Two-way A-transducers and AFL

DOI10.1016/S0022-0000(75)80017-1zbMath0303.68048OpenAlexW1984772743MaRDI QIDQ1216181

Donald I. Kiel

Publication date: 1975

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(75)80017-1

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Tree transducers, L systems, and two-way machines ⋮ Iterated stack automata and complexity classes ⋮ One way finite visit automata ⋮ Three hierarchies of transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Checking automata and one-way stack languages
• Principal AFL
• Substitution in families of languages
• A characterization of two-way deterministic classes of languages
• Absolutely parallel grammars and two-way finite-state transducers
• On AFL generators for finitely encoded AFA
• Control sets on grammars
• Studies in abstract families of languages
• Two-way sequential transductions and stack automata
• Structured Storage AFA

This page was built for publication: Two-way A-transducers and AFL