The following pages link to (Q4474150):
Displayed 16 items.
- On the state complexity of reversals of regular languages (Q596099) (← links)
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- State complexity of basic operations on suffix-free regular languages (Q1029324) (← 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)
- State-complexity hierarchies of uniform languages of alphabet-size length (Q2271458) (← links)
- Estimation of state complexity of combined operations (Q2271462) (← 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)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- The Average State Complexity of the Star of a Finite Set of Words Is Linear (Q3533005) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598) (← links)
- State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal (Q5200089) (← links)