๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Exponential upper and lower bounds for the order of a regular language

โœ Scribed by Andreas Weber

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
547 KB
Volume
134
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A lower bound on the order of regular gr
A lower bound on the order of regular graphs with given girth pair
โœ C. Balbuena; T. Jiang; Y. Lin; X. Marcote; M. Miller ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 129 KB ๐Ÿ‘ 1 views

## Abstract The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existence of regular graphs with given degree and girth pair was proved by Harary and Kovรกcs [Regular graphs with given girth pair, J Graph Theory 7 (1983), 209โ€“218]. A (ฮด, __g__)โ€cage is a small

Upper and lower bounds for the average-c
Upper and lower bounds for the average-case complexity of path-search
โœ Pippenger, Nicholas ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 125 KB ๐Ÿ‘ 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent