On the number of accepting states of finite automata
From MaRDI portal
Publication:3178872
DOI10.25596/JALC-2016-055zbMATH Open1362.68134OpenAlexW2577563219MaRDI QIDQ3178872FDOQ3178872
Publication date: 20 December 2016
Full work available at URL: https://search.datacite.org/works/10.25596/JALC-2016-055
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
minimizationdescriptional complexityfinite-state automataregular languagesdeterministic automatastate complexity
Cited In (17)
- Title not available (Why is that?)
- Operational union-complexity
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Further Remarks on the Operational Nonterminal Complexity
- Experiments with automata when the upper bound of the number of their states is unknown
- On the accepting state complexity of operations on permutation automata
- On the number of active states in finite automata
- Title not available (Why is that?)
- Operational complexity and pumping lemmas
- The Ranges of Accepting State Complexities of Languages Resulting from Some Operations
- Title not available (Why is that?)
- Operational Accepting State Complexity: The Unary and Finite Case
- 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)
