The following pages link to (Q4412108):
Displaying 21 items.
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- On the existence of prime decompositions (Q880173) (← links)
- Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
- A general approach to state complexity of operations: formalization and limitations (Q1622968) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- Complementing unary nondeterministic automata (Q1763723) (← links)
- Finite transducers and nondeterministic state complexity of regular languages (Q1956627) (← links)
- Usefulness of information and unary languages (Q2232271) (← links)
- Estimation of state complexity of combined operations (Q2271462) (← links)
- State complexity of combined operations (Q2383591) (← links)
- Transition complexity of language operations (Q2465047) (← links)
- (Q4794307) (← links)
- Operational Accepting State Complexity: The Unary and Finite Case (Q5205038) (← links)
- On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
- The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case (Q6070753) (← links)
- The nondeterministic state complexity of the site-directed deletion language operation (Q6175008) (← links)
