A characterization of context-free string languages by directed node- label controlled graph grammars

DOI10.1007/BF00289591zbMath0464.68077OpenAlexW1994753582MaRDI QIDQ1154289

Grzegorz Rozenberg, Dirk Janssens

Publication date: 1981

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289591

zbMATH Keywords

context-free languagessequential graph rewriting systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Traces, dependency graphs and DNLC grammars, On the membership problem for regular DNLC grammars, Handle NLC grammars and r. e. languages, Theory of traces, The complexity of regular DNLC graph languages, Boundary graph grammars with dynamic edge relabeling, Results of NLC grammars with one-letter terminal alphabets, Graph grammars according to the type of input and manipulated data: a survey, The bounded degree problem for NLC grammars is decidable, On structured graph grammars. II, On structured graph grammars. I, Linear graph grammars: Power and complexity, Generating irregular partitionable data structures, Restrictions on NLC graph grammars

Cites Work

• Restrictions, extensions, and variations of NLC grammars
• Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
• The Sequence Equivalence Problem is Decidable for 0S Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item