Graph automata for linear graph languages

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

Volumn 1073, Issue , 1996, Pages 336-350

  Brandenburg, F J ^a   Skodinis, K ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; FORMAL LANGUAGES; GRAPH THEORY; VISUAL LANGUAGES;

CONSISTENCY CONDITIONS; EDGE-SEPARATOR; FINITE GRAPHS; FINITE STATE CONTROL; GRAPH GRAMMAR; GRAPH LANGUAGES; GRAPH SEARCHING; LABELED GRAPHS;

AUTOMATA THEORY;

EID: 21344440782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61228-9_97     Document Type: Conference Paper

References (19)

1. D. Bienstock, P. Seymour. Monotonicity in graph searching. J. Algorithms 12 (1991), 239-245.
2. F.J. Brandenburg. Designing graph drawings by layout graph grammars. Proc. Workshop on Graph Drawing 94, LNCS 894 (1995), 416-427.
3. B. Courcelle. Graph rewriting: an algebraic and logic approach. Handbook of Theoretical Computer Science, Elsevier, Amsterdam, (1990) 193-242.
4. H. Ehrig, H.J. Kreowski, G. Rozenberg. Proc. 4. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 532 (1991).
5. J. Engelfriet. Context-free NCE graph grammars. Proc. FCT 89, LNCS 380 (1989), 148-161.
6. J. Engelfriet, G. Leih. Linear graph grammars: power and complexity. Inform. Comput. 81 (1989), 88-121.
7. F. Gécseg, M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest (1984).
8. T. Hickl. Rechtwinkliges Layout von hierarchisch strukturierten Graphen. Dissertation, Universität Passau (1994).
9. D. Janssens, G. Rozenberg, E. Welzl. The bounded degree problem for NLC graph grammars is decidable. J. Comput. System Sci. 33 (1986), 415-422.
10. M. Kaul. Practical applications of precedence graph grammars. Proc. 3. Workshop on Graph Grammars and their Application to Computer Science, LNCS 291 (1987), 326-342.
11. A.S. LaPaugh. Recontamination does not help to search a graph. J. Assoc. Comput. Mach. 40 (1993), 224-245.
12. N. Megiddo, S.L. Hakimi, M. R. Garey, D.S. Johnson, C.H. Papadim-itriou. The complexity of searching a graph. J. Assoc. Comput. Mach. 35 (1988), 18-44
13. M. Nagl. Graph Grammatiken. Vieweg, Braunschweig (1979).
14. J.L. Pfaltz, A. Rosenfeld. Web Grammars. Proc. Joint Intern. Conference on Artificial Intelligence, Washington, D.C., (1969), 609-619.
15. E. Remila. Fundamental study-Recognition of graphs by automata. Theor. Comput. Sci. 136 (1994), 291-332.
16. A. Rosenfeld, D.L. Milgram. Web automata and web grammars. Machine Intelligence 7 (1972), 307-324
17. G. Rozenberg, E. Welzl. Boundary NLC graph grammars-Basic definitions, normal forms and complexity. Inform. Control 69 (1986), 136-167.
18. A. Wu, R. Rosenfeld. Cellular graph automata I. Inform. Control 42 (1979), 305-329.
19. A. Wu, R. Rosenfeld. Cellular graph automata II. Inform. Control 42 (1979), 330-353.