A real-time strictness test for deterministic pushdown automata

DOI10.1016/S0019-9958(80)90256-9MaRDI QIDQ3949982zbMATH OpenFDO

Authors Michio Oyamaguchi, Yasuyoshi Inagaki, N. Honda

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)90256-9

zbMATH Keywords

containment problemdecidability of the strictness problem of context-free languagesreal- time deterministic pushdown automaton with empty stack acceptance

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(3)

• Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
• A hierarchy of real-time deterministic languages and their equivalence
• New families of non real time dpda's and their decidability results

This page was built for publication: A real-time strictness test for deterministic pushdown automata

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