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)
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Turing machines and related notions (03D10)
Related Items (2)
Superdeterministic DPDAs: The method of accepting does affect decision problems ⋮ On the decidability of equivalence for deterministic pushdown transducers
This page was built for publication: Tape bounds for some subclasses of deterministic context-free languages
