On the generative power of sequential and parallel programmed graph grammars
- 1 June 1982
- journal article
- Published by Springer Nature in Computing
- Vol. 29 (2) , 89-112
- https://doi.org/10.1007/bf02249935
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- A pumping lemma for context-free graph languagesPublished by Springer Nature ,2005
- Explicit versus implicit parallel rewriting on graphsPublished by Springer Nature ,2005
- Transformations of data base structuresPublished by Springer Nature ,2005
- Rewriting systems as a tool for relational data base designPublished by Springer Nature ,2005
- A tutorial and bibliographical survey on graph grammarsPublished by Springer Nature ,2005
- Introduction to the algebraic theory of graph grammars (a survey)Published by Springer Nature ,2005
- PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†International Journal of General Systems, 1976
- Linear and Context-Free Graph GrammarsJournal of the ACM, 1972
- Pair grammars, graph languages and string-to-graph translationsJournal of Computer and System Sciences, 1971
- Programmed Grammars and Classes of Formal LanguagesJournal of the ACM, 1969