Limited Automata and Context-Free Languages
From MaRDI portal
Publication:2805404
DOI10.3233/FI-2015-1148zbMath1335.68128WikidataQ116841313 ScholiaQ116841313MaRDI QIDQ2805404
Andrea Pisoni, Giovanni Pighizzini
Publication date: 11 May 2016
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Turing machinesfinite automataformal languagesdescriptional complexitydeterministic context-free languages
Related Items (15)
A linear-time simulation of deterministic \(d\)-limited automata ⋮ Deterministic Stack Transducers ⋮ Performing regular operations with 1-limited automata ⋮ Reversible Limited Automata ⋮ Unnamed Item ⋮ 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 ⋮ Algebraic state space approach to model and control combined automata ⋮ Language acceptability of finite automata based on theory of semi‐tensor product of matrices ⋮ Linear-time limited automata ⋮ Limited automata and unary languages ⋮ Deterministic Stack Transducers ⋮ Descriptional complexity of regular languages ⋮ On Simulation Cost of Unary Limited Automata
This page was built for publication: Limited Automata and Context-Free Languages
