Two-way sequential transductions and stack automata

DOI10.1016/S0019-9958(71)90483-9MaRDI QIDQ5628038zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(13)

• The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
• 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
• Absolutely parallel grammars and two-way finite-state transducers
• Two-way counter machines and finite-state transducers†
• scientific article; zbMATH DE number 3602690 (Why is no real title available?)
• Outils et résultats pour les transducteurs boustrophédons
• Three hierarchies of transducers

This page was built for publication: Two-way sequential transductions and stack automata

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