The power of programmed grammars with graphs from various classes

DOI10.1007/BF02896458MaRDI QIDQ854407zbMATH OpenOpenAlexFDO

Authors Madalina Barbaiani, Cristina Bibire, Aidan Delaney, Szilárd Zsolt Fazekas, Mihai Ionescu, Guangwu Liu, Atif Lodhi, Benedek Nagy, Jürgen Dassow

Publication date 4 December 2006

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• Linear graph grammars: Power and complexity
• scientific article; zbMATH DE number 3885330
• scientific article; zbMATH DE number 3872712
• scientific article; zbMATH DE number 177436
• scientific article; zbMATH DE number 4051027
• Structure graphs and structure graph grammars
• scientific article; zbMATH DE number 1539544
• scientific article; zbMATH DE number 3909759
• On structured graph grammars. I
• Deterministic graph grammars

Cites work

• scientific article; zbMATH DE number 2182422 (Why is no real title available?)
• scientific article; zbMATH DE number 4062631 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1047924 (Why is no real title available?)
• scientific article; zbMATH DE number 2150284 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Nonterminal complexity of programmed grammars.
• On the planarity of bicolored digraph grammar systems
• Programmed Grammars and Classes of Formal Languages
• Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars

Cited in

(7)

• scientific article; zbMATH DE number 1539544 (Why is no real title available?)
• Designing and Learning Substitutable Plane Graph Grammars
• scientific article; zbMATH DE number 219234 (Why is no real title available?)
• Programmed grammars and their relation to the LBA problem
• Programmed grammars with rule queues
• Linear graph grammars: Power and complexity
• Workspace theorems for regular-controlled grammars

This page was built for publication: The power of programmed grammars with graphs from various classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854407)