Two-way sequential transductions and stack automata

DOI10.1016/S0019-9958(71)90483-9zbMath0222.94063OpenAlexW1975291577MaRDI QIDQ5628038

Roger W. Ehrich, Stephen S. Yau

Publication date: 1971

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(71)90483-9

Mathematics Subject Classification ID

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

Related Items

The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index, Unnamed Item, Tree transducers, L systems, and two-way machines, Two-way A-transducers and AFL, Characterization theorems on abstract families of transducers, One way finite visit automata, Classes of formal grammars, On two-way sequential transductions of full semi-AFL's, Some decision problems concerning sequential transducers and checking automata, Outils et résultats pour les transducteurs boustrophédons, Absolutely parallel grammars and two-way finite-state transducers, Three hierarchies of transducers, Two-way counter machines and finite-state transducers†