Tape bounds for some subclasses of deterministic context-free languages
From MaRDI portal
Publication:4153617
DOI10.1016/S0019-9958(78)90570-3zbMath0376.68050MaRDI QIDQ4153617
No author found.
Publication date: 1978
Published in: Information and Control (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
03D10: Turing machines and related notions
Related Items
Superdeterministic DPDAs: The method of accepting does affect decision problems, On the decidability of equivalence for deterministic pushdown transducers
