A generalization of context-free determinism
From MaRDI portal
Publication:5554975
DOI10.1016/S0019-9958(67)90513-XzbMath0168.25801MaRDI QIDQ5554975
Publication date: 1967
Published in: Information and Control (Search for Journal in Brave)
Related Items (22)
A linear-time simulation of deterministic \(d\)-limited automata ⋮ Deterministic Stack Transducers ⋮ Performing regular operations with 1-limited automata ⋮ Deterministic realization of nondeterministic computations with a low measure of nondeterminism ⋮ Unnamed Item ⋮ Characterization of context-pree languages by erasing automata ⋮ Unnamed Item ⋮ Nondeterministic auxiliary depth-bounded storage automata and semi-unbounded fan-in cascading circuits (extended abstract) ⋮ Two-way machines and de Bruijn words ⋮ Once-Marking and Always-Marking 1-Limited Automata ⋮ Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata ⋮ Descriptional complexity of limited automata ⋮ Linear-time limited automata ⋮ LIMITED AUTOMATA AND REGULAR LANGUAGES ⋮ The halting problem for linear Turing assemblers ⋮ Limited automata and unary languages ⋮ A relation between space, return and dual return complexities ⋮ Deterministic Stack Transducers ⋮ Descriptional complexity of regular languages ⋮ On Simulation Cost of Unary Limited Automata ⋮ Theory of formal grammars ⋮ Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata
This page was built for publication: A generalization of context-free determinism
