Time-bounded controlled bidirectional grammars

DOI10.1080/00207169008803892MaRDI QIDQ3477981zbMATH OpenOpenAlexFDO

Authors Jan Anne Hogendorp

Publication date 1990

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

Full work available at URL https://research.utwente.nl/en/publications/timebounded-controlled-bidirectional-grammars(d15b50eb-4bd3-4389-bd21-e8fd3d99fcc2).html

zbMATH Keywords

algorithmsbidirectional grammarscontext-free grammarsderivational complexitytime-bounded grammars

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• On the generating power of regularly controlled bidirectional grammars
• On grammars controlled by Parikh vectors
• Capacity bounded grammars and Petri nets
• Grammars with control by ideals and codes
• Bidirectional cooperating distributed grammar systems

Cites work

• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• NTS languages are deterministic and congruential
• Thue systems as rewriting systems
• Time-bounded grammars and their languages

Cited in

(2)

• On the generating power of regularly controlled bidirectional grammars
• scientific article; zbMATH DE number 739127 (Why is no real title available?)

This page was built for publication: Time-bounded controlled bidirectional grammars

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