Strongly Limited Automata
From MaRDI portal
Publication:4589240
DOI10.3233/FI-2016-1439zbMATH Open1373.68284OpenAlexW2564145766MaRDI QIDQ4589240FDOQ4589240
Authors: Giovanni Pighizzini 
Publication date: 9 November 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2016-1439
Recommendations
- Limited automata and regular languages
- Limited automata and regular languages
- Limited automata and context-free languages
- On finite automata with limited nondeterminism
- Limited automata: properties, complexity and variants
- Limited automata and unary languages
- Limited automata and unary languages
- Descriptional complexity of limited automata
- scientific article; zbMATH DE number 3896304
- Linear-time limited automata
Cited In (10)
- Reversible limited automata
- Limited automata and unary languages
- Limited automata: properties, complexity and variants
- Limited automata and regular languages
- Limited automata and context-free languages
- Behavioral strengths and weaknesses of various models of limited automata
- Automata that may change their mind
- Restricted Turing machines and language recognition
- Limited automata and regular languages
- Reversible limited automata
This page was built for publication: Strongly Limited Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589240)
