The power of programmed grammars with graphs from various classes

DOI10.1007/BF02896458zbMath1104.68054OpenAlexW2104249789MaRDI QIDQ854407

Benedek Nagy, Mihai Ionescu, Guangwu Liu, Aidan Delaney, Madalina Barbaiani, Cristina Bibire, Atif Lodhi, Szilárd Zsolt Fazekas, Juergen 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)

Related Items (1)

Workspace theorems for regular-controlled grammars

Cites Work

• Nonterminal complexity of programmed grammars.
• Programmed Grammars and Classes of Formal Languages
• On the planarity of bicolored digraph grammar systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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