On the generating power of regularly controlled bidirectional grammars

DOI10.1080/00207169108804003MaRDI QIDQ3979697zbMATH OpenOpenAlexFDO

Authors Peter R. J. Asveld, Jan Anne Hogendorp

Publication date 26 June 1992

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://research.utwente.nl/en/publications/on-the-generating-power-of-regularly-controlled-bidirectional-grammars(406946b8-4d31-40e2-a1a1-43ad4d1d9366).html

zbMATH Keywords

complexity classesrecursively enumerable languagescontrolled context-free grammar

Mathematics Subject Classification ID

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

Recommendations

• Time-bounded controlled bidirectional grammars
• Bidirectional cooperating distributed grammar systems
• Grammars with control by ideals and codes

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• A hierarchy between context-free and context-sensitive languages
• Complete symmetry in d2l systems and cellular automata
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• How to Make Arbitrary Grammars Look Like Context-Free Grammars
• NTS grammars and Church-Rosser systems
• NTS languages are deterministic and congruential
• Reversal-bounded multipushdown machines
• The equivalence and inclusion problems for NTS languages
• Time-bounded controlled bidirectional grammars
• Time-bounded grammars and their languages

Cited in

(2)

• Time-bounded controlled bidirectional grammars
• Cooperating Distributed Tree Automata

This page was built for publication: On the generating power of regularly controlled bidirectional grammars

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