The following pages link to (Q4418610):
Displaying 18 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)
- Incomplete operational transition complexity of regular languages (Q498392) (← links)
- State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← 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)
- Finite transducers and nondeterministic state complexity of regular languages (Q1956627) (← links)
- Operational complexity and right linear grammars (Q2041682) (← links)
- Operational complexity and pumping lemmas (Q2170280) (← links)
- State complexity of combined operations (Q2383591) (← links)
- On the average state and transition complexity of finite languages (Q2465048) (← links)
- State Complexity of Catenation Combined with Union and Intersection (Q3073626) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal (Q5200089) (← links)
- The State Complexity of Permutations on Finite Languages over Binary Alphabets (Q5500695) (← links)
- Further Remarks on the Operational Nonterminal Complexity (Q6114830) (← links)
- Algorithms for checking intersection non-emptiness of regular expressions (Q6605358) (← links)
