NFA-to-DFA trade-off for regular operations

DOI10.1007/978-3-030-23247-4_14MaRDI QIDQ2179337zbMATH OpenOpenAlexFDO

Authors Galina Jirásková, Ivana Krajňáková

Publication date 12 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-23247-4_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• State complexity of some operations on binary regular languages
• Operations on Unambiguous Finite Automata
• scientific article; zbMATH DE number 1962776
• The state complexities of some basic operations on regular languages
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES

Cited in

(8)

• scientific article; zbMATH DE number 1452984 (Why is no real title available?)
• Operations on Boolean and alternating finite automata
• Descriptional and computational complexity of the circuit representation of finite automata
• Power, positive closure, and quotients on convex languages
• Operational complexity: NFA-to-DFA trade-off
• Descriptional complexity of the forever operator
• scientific article; zbMATH DE number 1962776 (Why is no real title available?)
• Operations on Permutation Automata

This page was built for publication: NFA-to-DFA trade-off for regular operations

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