Representing hyper-graphs by regular languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1450 LNCS, Issue , 1998, Pages 571-579

  La Torre, Salvatore ^a   Napoli, Margherita ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPACT REPRESENTATION; EQUATIONAL GRAPHS; EXPRESSIVE POWER; FINITE GRAPHS; GRAPH REPRESENTATION; INFINITE GRAPH; LABELLED TREES; PREFIX-FREE;

ALGORITHMS; COMPUTER SCIENCE; CONTEXT FREE LANGUAGES; FORESTRY; GRAPHIC METHODS; COMPUTATIONAL LINGUISTICS; GRAPH THEORY;

TREES (MATHEMATICS);

EID: 84896750719     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. S. Arnborg, J. Lagergren and D. Seese, "Easy problems for tree-decomposable graphs,", Journal of Algorithms, 12 (1991) 308-340.
2. K. Barthelmann, "When Can an Equational Simple Graph Be Generated by Hy-peredge Replacement?,", this Volume.
3. M. Bauderon and B. Courcelle, "Graph Expressions and Graph Rewritings,", Mathematical System Theory, 20 (1987) 83-127.
4. H. L. Bodlaender and R. H. Möhring, "The pathwidth and treewidth of cographs,", SIAM Journal on Discrete Mathematics, 6 (2) (1993) 181-188.
5. D. Caucal, "On infinite transition graphs having a decidable monadic theory,", Proc. of ICALP'96, (F. M. auf der Heide and B. Monien, Eds.), Lecture Notes in Computer Science, Vol. 1099 (1996) 194-205.
6. D. G. Corneil, H. Lerchs and L. Stuart Burlingham, "Complement reducible graphs,", Discrete Applied Mathematics, 3 (1981) 163-174.
7. B. Courcelle, "The monadic second-order logic of graphs. II. Infinite graphs of bounded width,", Mathematical System Theory, 21 (1989) 187-121.
8. B. Courcelle, "The monadic second-order logic of graphs. III. Tree-width, forbidden minors and complexity issues,", RAIRO Inform. Théor. Appl, 26 (1992) 257-286.
9. A. Ehrenfeucht, J. Engelfriet and G. Rozenberg, "Finite Languages for the Representation of Finite Graphs,", Journal of Computer and System Sciences, 52 (1996) 170-184.
10. J. Engelfriet, T. Harju, A. Proskurowski and G. Rozenberg, "Characterization and Complexity of Uniformly Non-primitive Labeled 2-Structures,", Theoretical Computer Science, 154 (1996) 247-282.
11. J. Hopcroft and J. Ullman, "Introduction to Automata Theory, Formal Languages and Computation," Addison-Wesley Series in Computer Science (Addison-Wesley Publishing Company) (1979).
12. N. Robertson and P. Seymour, "Graph Minors. II Algorithmic aspects of tree-width,", Journal of Algorithms, 7 (1986) 309-322.
13. J. Valdez, R. E. Tarjan and E. Lawler, "The recognition of series parallel digraphs,", SIAM Journal of Computing, 11 (1982) 298-313.
14. www.unisa.it/papers/g.ps.gz