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

DOI10.1016/0020-0190(84)90120-0zbMath0548.68078OpenAlexW2093170711MaRDI QIDQ799387

Michio Oyamaguchi

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)90120-0

zbMATH Keywords

deterministic pushdown automatasubclass containment

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

The extended equivalence problem for a class of non-real-time deterministic pushdown automata

Cites Work

• New families of non real time dpda's and their decidability results
• Some negative results concerning DPDA's
• Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
• A note on non-singular deterministic pushdown automata
• The equivalence problem for some non-real-time deterministic pushdown automata

This page was built for publication: Some remarks on subclass containment problems for several classes of dpda's