Performing regular operations with 1-limited automata

DOI10.1007/978-3-031-05578-2_19MaRDI QIDQ2164004zbMATH OpenOpenAlexFDO

Authors Giovanni Pighizzini, Luca Prigioniero, Šimon Sádovský

Publication date 11 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-05578-2_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Limited automata and regular languages
• Limited automata and regular languages
• Operations on Unambiguous Finite Automata
• Operations on Unambiguous Finite Automata
• Operations preserving regular languages
• Operations on Self-Verifying Finite Automata
• Operations on Permutation Automata
• Limited automata and unary languages
• Limited automata and unary languages
• Operations on Boolean and alternating finite automata

Cites work

• 1-limited automata: witness languages and techniques
• A generalization of context-free determinism
• Behavioral strengths and weaknesses of various models of limited automata
• scientific article; zbMATH DE number 3936519 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3353192 (Why is no real title available?)
• Limited automata and context-free languages
• Limited automata and regular languages
• Limited automata and unary languages
• Limited automata: properties, complexity and variants
• Linear-time limited automata
• On the state complexity of operations on two-way finite automata
• State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
• Succinct representation of regular languages by Boolean automata
• The state complexities of some basic operations on regular languages

Cited in

(1)

• Performing regular operations with 1-limited automata

This page was built for publication: Performing regular operations with 1-limited automata

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