Strongly Limited Automata

DOI10.3233/FI-2016-1439MaRDI QIDQ4589240zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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)