A simplicity test for deterministic pushdown automata

DOI10.1016/S0019-9958(80)90263-6MaRDI QIDQ3908478zbMATH OpenFDO

Authors Michio Oyamaguchi, Yasuyoshi Inagaki

Publication date 1980

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(80)90263-6

zbMATH Keywords

real-time deterministic pushdown automatasimple context free languagesimple deterministic pushdown automatasimplicity problemsubclass containment problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(1)

• Some results on subclass containment problems for special classes of dpda's related to nonsingular machines

This page was built for publication: A simplicity test for deterministic pushdown automata

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