On the generative power of sequential and parallel programmed graph grammars
From MaRDI portal
Publication:1163378
DOI10.1007/BF02249935zbMath0483.68065MaRDI QIDQ1163378
Publication date: 1982
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02249935
hierarchy; graph languages; application order of productions; context free graph languages; control diagram; parallel replacement; sequential replacement
68Q45: Formal languages and automata
Related Items
Recent advances in graph-based pattern recognition with applications in document analysis, P systems with local graph productions
Cites Work
- A system of graph grammars which generates all recursively enumerable sets of labelled graphs
- Grammars on partial graphs
- Formal languages of labelled graphs
- On labelled graph grammars
- Pair grammars, graph languages and string-to-graph translations
- PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†
- Context-free graph grammars
- Programmed Grammars and Classes of Formal Languages
- Separable graphs, planar graphs and web grammars
- Linear and Context-Free Graph Grammars
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item