Some negative results concerning DPDA's

DOI10.1016/0020-0190(84)90008-5zbMath0564.68058OpenAlexW2088734950MaRDI QIDQ1058306

No author found.

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90008-5

zbMATH Keywords

rational transductiondeterministic pushdown automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Some remarks on subclass containment problems for several classes of dpda's

Cites Work

• New families of non real time dpda's and their decidability results
• A representation of trees by languages. I
• The equivalence problem for real-time strict deterministic languages

This page was built for publication: Some negative results concerning DPDA's