The following pages link to State complexity of power (Q1019718):
Displaying 28 items.
- State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- State complexity of combined operations with two basic operations (Q441851) (← links)
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Operations on subregular languages and nondeterministic state complexity (Q2112186) (← links)
- State complexity of unambiguous operations on finite automata (Q2334604) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- Undecidability of state complexity (Q2855756) (← links)
- State Complexity of Kleene-Star Operations on Trees (Q2891328) (← links)
- COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (Q2909101) (← links)
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL (Q2909180) (← links)
- State Complexity of Catenation Combined with Union and Intersection (Q3073626) (← links)
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION (Q3224949) (← links)
- On the State Complexity of Operations on Two-Way Finite Automata (Q3533031) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- (Q5003075) (← links)
- (Q5020533) (← links)
- A Study of a Simple Class of Modifiers: Product Modifiers (Q5041253) (← links)
- State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal (Q5200089) (← links)
- State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet (Q5200094) (← links)
- Square on Deterministic, Alternating, and Boolean Finite Automata (Q5205045) (← links)
- State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
- Operational State Complexity of Subtree-Free Regular Tree Languages (Q5298309) (← links)
- State complexity of deletion and bipolar deletion (Q5963404) (← links)
- Nondeterministic operational complexity in subregular languages (Q6093571) (← links)
