Tape bounds for some subclasses of deterministic context-free languages

DOI10.1016/S0019-9958(78)90570-3MaRDI QIDQ4153617zbMATH OpenFDO

Authors

Publication date 1978

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(78)90570-3

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cited in

(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

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