Controlled pushdown automata

DOI10.1016/0020-0255(73)90047-9zbMath0278.68047OpenAlexW2077424795MaRDI QIDQ1394126

Oscar H. Ibarra

Publication date: 1973

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(73)90047-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Equivalence problem of mappings relative to languages ⋮ Unnamed Item ⋮ Tree transducers, L systems, and two-way machines ⋮ 2DST mappings of languages and related problems ⋮ One way finite visit automata ⋮ Classes of formal grammars ⋮ On two-way sequential transductions of full semi-AFL's ⋮ A note on Parikh maps, abstract languages, and decision problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the inherent ambiguity of simple tuple languages
• Finite-turn checking automata
• AFL with the semilinear property
• On equal matrix languages
• Multi-tape and multi-head pushdown automata
• Simple matrix languages

This page was built for publication: Controlled pushdown automata