A real-time strictness test for deterministic pushdown automata
From MaRDI portal
Publication:3949982
DOI10.1016/S0019-9958(80)90256-9zbMath0488.68050MaRDI QIDQ3949982
Namio Honda, Yasuyoshi Inagaki, Michio Oyamaguchi
Publication date: 1980
Published in: Information and Control (Search for Journal in Brave)
containment problemdecidability of the strictness problem of context-free languagesreal- time deterministic pushdown automaton with empty stack acceptance
Related Items (max. 100)
A hierarchy of real-time deterministic languages and their equivalence ⋮ New families of non real time dpda's and their decidability results ⋮ Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
This page was built for publication: A real-time strictness test for deterministic pushdown automata
