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 (31)
- Two double-exponential gaps for automata with a limited pushdown
- Linear-time limited automata
- A linear-time simulation of deterministic \(d\)-limited automata
- Reversible limited automata
- Strongly Limited Automata
- Non-self-embedding grammars, constant-height pushdown automata, and limited automata
- Non-self-embedding grammars, constant-height pushdown automata, and limited automata
- Limited automata and unary languages
- Limited automata and unary languages
- Limited automata: properties, complexity and variants
- Language acceptability of finite automata based on theory of semi-tensor product of matrices
- Performing regular operations with 1-limited automata
- Descriptional complexity of limited automata
- Deterministic stack transducers
- Limited automata and regular languages
- Monoid automata for displacement context-free languages
- Simulating finite automata with context-free grammars.
- Performing regular operations with 1-limited automata
- Deterministic stack transducers
- Once-Marking and Always-Marking 1-Limited Automata
- Title not available (Why is that?)
- On simulation cost of unary limited automata
- Descriptional complexity of regular languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata
- Restricted Turing machines and language recognition
- Limited automata and regular languages
- Algebraic state space approach to model and control combined automata
- Two double-exponential gaps for automata with a limited pushdown
- 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)
