Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
From MaRDI portal
Publication:1060563
DOI10.1016/0304-3975(84)90039-2zbMath0568.68067OpenAlexW2090865410MaRDI QIDQ1060563
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90039-2
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Superdeterministic DPDAs: The method of accepting does affect decision problems
- The simultaneous accessibility of two configurations of two equivalent DPDA's
- The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine
- A result on the equivalence problem for deterministic pushdown automata
- On equivalence and subclass containment problems for deterministic context-free languages
- A note on non-singular deterministic pushdown automata
- Linearity is polynomially decidable for realtime pushdown store automata
- A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata
- Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
- The equivalence problem for real-time strict deterministic languages
- A simplicity test for deterministic pushdown automata
- A real-time strictness test for deterministic pushdown automata
- Regularity and Related Problems for Deterministic Pushdown Automata
- On jump-deterministic pushdown automata
- The equivalence problem for deterministic finite-turn pushdown automata
- A regularity test for pushdown machines
- Properties of deterministic top-down grammars
- Real-Time Strict Deterministic Languages
This page was built for publication: Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
