On two-way sequential transductions of full semi-AFL's

DOI10.1016/0304-3975(78)90019-1zbMath0387.68047OpenAlexW2077536516MaRDI QIDQ1249942

Oscar H. Ibarra

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0304-3975(78)90019-1

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Some decision problems concerning sequential transducers and checking automata ⋮ Outils et résultats pour les transducteurs boustrophédons

Cites Work

• Unnamed Item
• One way finite visit automata
• Controlled pushdown automata
• Checking automata and one-way stack languages
• Principal AFL
• Finite-turn checking automata
• AFL with the semilinear property
• Absolutely parallel grammars and two-way finite-state transducers
• On Context-Free Languages
• On equal matrix languages
• Studies in abstract families of languages
• Simple matrix languages
• Two-way sequential transductions and stack automata

This page was built for publication: On two-way sequential transductions of full semi-AFL's