NFA-to-DFA trade-off for regular operations

DOI10.1007/978-3-030-23247-4_14zbMATH Open1434.68263OpenAlexW2955901052MaRDI QIDQ2179337FDOQ2179337

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (8)

• Title not available (Why is that?)
• Operations on Boolean and alternating finite automata
• Descriptional complexity of the forever operator
• Power, positive closure, and quotients on convex languages
• Operational complexity: NFA-to-DFA trade-off
• Descriptional and computational complexity of the circuit representation of finite automata
• Operations on Permutation Automata
• Title not available (Why is that?)

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)