Pages that link to "Item:Q3178872"
From MaRDI portal
The following pages link to On the Number of Accepting States of Finite Automata (Q3178872):
Displaying 16 items.
- Lower bound for the number of states of purposeful deterministic automata (Q796993) (← links)
- Experiments with automata when the upper bound of the number of their states is unknown (Q1570268) (← links)
- On the number of active states in finite automata (Q2041683) (← links)
- Operational union-complexity (Q2113386) (← links)
- Operational complexity and pumping lemmas (Q2170280) (← links)
- Transition complexity of language operations (Q2465047) (← links)
- (Q4036600) (← links)
- (Q4412113) (← links)
- (Q4427884) (← links)
- (Q4857725) (← links)
- Operational Accepting State Complexity: The Unary and Finite Case (Q5205038) (← links)
- Applications of the finite state automata for counting restricted permutations and variations (Q5259332) (← links)
- Magic Numbers in the State Hierarchy of Finite Automata (Q5756671) (← links)
- The Ranges of Accepting State Complexities of Languages Resulting from Some Operations (Q5859667) (← links)
- Further Remarks on the Operational Nonterminal Complexity (Q6114830) (← links)
- On the accepting state complexity of operations on permutation automata (Q6186540) (← links)