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