Limited automata and context-free languages
From MaRDI portal
Publication:2805404
DOI10.3233/FI-2015-1148zbMATH Open1335.68128WikidataQ116841313 ScholiaQ116841313MaRDI QIDQ2805404FDOQ2805404
Authors: Giovanni Pighizzini, Andrea Pisoni 
Publication date: 11 May 2016
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Recommendations
descriptional complexityfinite automataformal languagesTuring machinesdeterministic context-free languages
Cited In (23)
- Language acceptability of finite automata based on theory of semi‐tensor product of matrices
- Linear-time limited automata
- A linear-time simulation of deterministic \(d\)-limited automata
- Strongly Limited Automata
- Limited automata and unary languages
- Limited automata and unary languages
- Limited automata: properties, complexity and variants
- Performing regular operations with 1-limited automata
- Reversible Limited Automata
- Descriptional complexity of limited automata
- On Simulation Cost of Unary Limited Automata
- Simulating finite automata with context-free grammars.
- Performing regular operations with 1-limited automata
- Once-Marking and Always-Marking 1-Limited Automata
- Title not available (Why is that?)
- Deterministic Stack Transducers
- Descriptional complexity of regular languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deterministic Stack Transducers
- Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata
- Algebraic state space approach to model and control combined automata
- Deep pushdown automata
This page was built for publication: Limited automata and context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805404)
