On the number of accepting states of finite automata

DOI10.25596/JALC-2016-055MaRDI QIDQ3178872zbMATH OpenOpenAlexFDO

Authors Jürgen Dassow

Publication date 20 December 2016

Full work available at URL https://search.datacite.org/works/10.25596/JALC-2016-055

zbMATH Keywords

descriptional complexitydeterministic automatafinite-state automataminimizationregular languagesstate complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The ranges of accepting state complexities of languages resulting from some operations
• State complexity of regular languages
• scientific article; zbMATH DE number 2201359
• Operational accepting state complexity: the unary and finite case
• The state complexities of some basic operations on regular languages

Cited in

(21)

• Experiments with automata when the upper bound of the number of their states is unknown
• On the number of active states in finite automata
• Operational union-complexity
• Operational complexity and pumping lemmas
• On the number of active states in deterministic and nondeterministic finite automata
• Transition complexity of language operations
• scientific article; zbMATH DE number 176770 (Why is no real title available?)
• scientific article; zbMATH DE number 1948499 (Why is no real title available?)
• scientific article; zbMATH DE number 1979537 (Why is no real title available?)
• scientific article; zbMATH DE number 822047 (Why is no real title available?)
• Operational accepting state complexity: the unary and finite case
• Applications of the finite state automata for counting restricted permutations and variations
• What is a complex regular language?
• Magic Numbers in the State Hierarchy of Finite Automata
• The ranges of accepting state complexities of languages resulting from some operations
• Further Remarks on the Operational Nonterminal Complexity
• On the accepting state complexity of operations on permutation automata
• On the accepting state complexity of operations on permutation automata
• On deterministic finite automata equipped with partial orders
• Title not available (Why is no real title available?)
• Lower bound for the number of states of purposeful deterministic automata

This page was built for publication: On the number of accepting states of finite automata

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