Abstract grammars based on transductions

DOI10.1016/0304-3975(91)90195-8zbMath0742.68037OpenAlexW2124766503MaRDI QIDQ1176481

Peter R. J. Asveld

Publication date: 25 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/abstract-grammars-based-on-transductions(5703e8d2-b2d7-44ef-bbfb-85f8243f31a8).html

zbMATH Keywords

\({\mathcal T}\)-grammardecidability and complexity questions

Mathematics Subject Classification ID

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

Related Items (1)

A Kleene characterization of computability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Grammar and L forms: an introduction
• Complexity theory and the operational structure of algebraic programming systems
• EOL systems with control devices
• The membership question for ETOL-languages is polynomially complete
• Context-free grammar forms
• Iterated deterministic-substitution
• EOL forms
• Extended linear macro grammars, iteration grammars, and register programs
• Optimization of LR(k) parsers
• Space-bounded complexity classes and iterated deterministic substitution
• Time and space complexity of inside-out macro languages
• Transductions and the parallel generation of languages^†
• TOL schemes and control sets
• A note on Lindenmayer systems, Szilard languages, spectra, and equivalence
• Iterated a-NGSM maps and Γ systems
• Controlled iteration grammars and full hyper-AFL's
• Grammar Schemata
• On the Automorphism Group of an Automaton

This page was built for publication: Abstract grammars based on transductions