Time-bounded controlled bidirectional grammars

DOI10.1080/00207169008803892zbMath0699.68094OpenAlexW3023156432MaRDI QIDQ3477981

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

algorithmscontext-free grammarsderivational complexitybidirectional grammarstime-bounded grammars

Mathematics Subject Classification ID

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

Related Items (1)

On the generating power of regularly controlled bidirectional grammars

Cites Work

• NTS languages are deterministic and congruential
• Thue systems as rewriting systems
• Time-bounded grammars and their languages
• Unnamed Item

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