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

Finite graph-acceptors and regular graph-languages

โœ Scribed by Kurt-Ulrich Witt

Book ID
114037566
Publisher
Elsevier Science
Year
1981
Weight
595 KB
Volume
50
Category
Article
ISSN
0019-9958

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Embedding arbitrary finite simple graphs
Embedding arbitrary finite simple graphs into small strongly regular graphs
โœ Jajcay, Robert; Mesner, Dale ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 235 KB ๐Ÿ‘ 1 views

It is well known that any finite simple graph ฮ“ is an induced subgraph of some exponentially larger strongly regular graph ฮ“ (e.g., [2,8]). No general polynomial-size construction has been known. For a given finite simple graph ฮ“ on v vertices, we present a construction of a strongly regular graph ฮ“

On process languages in finite graphs
On process languages in finite graphs
โœ K. V. Shakhbazyan; Y. H. Shoukourian ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer US ๐ŸŒ English โš– 613 KB
Finite Languages for the Representation
Finite Languages for the Representation of Finite Graphs
โœ Andrzej Ehrenfeucht; Joost Engelfriet; Grzegorz Rozenberg ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 538 KB

We introduce a new way of specifying graphs: through languages, i.e., sets of strings. The strings of a given (finite, prefix-free) language represent the vertices of the graph; whether or not there is an edge between the vertices represented by two strings is determined by the pair of symbols at th