Limited automata and regular languages

DOI10.1007/978-3-642-39310-5_24MaRDI QIDQ2843101zbMATH OpenOpenAlexWikidataFDO

Authors Giovanni Pighizzini, Andrea Pisoni

Publication date 9 August 2013

Published in Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39310-5_24

zbMATH Keywords

context-free languagesdescriptional complexityfinite automataformal languagesregular languagesTuring machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Limited automata and regular languages
• Limited automata and context-free languages
• Limited automata and unary languages
• Limited automata and unary languages
• Strongly Limited Automata

Cited in

(14)

• Descriptional complexity of limited automata
• Performing regular operations with 1-limited automata
• Limited automata: properties, complexity and variants
• Limited automata and context-free languages
• Bideterministic Automata and Minimal Representations of Regular Languages
• scientific article; zbMATH DE number 3902070 (Why is no real title available?)
• Strongly Limited Automata
• Limited automata and regular languages
• 1-limited automata: witness languages and techniques
• Linear-time limited automata
• Limited automata and unary languages
• Linear-time limited automata
• Limited automata and unary languages
• Performing regular operations with 1-limited automata

This page was built for publication: Limited automata and regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843101)