The following pages link to State complexity of cyclic shift (Q3515466):
Displaying 19 items.
- Descriptional complexity of regular languages (Q2074214) (← links)
- Combination of roots and Boolean operations: an application to state complexity (Q2105451) (← links)
- Maximal state complexity and generalized de Bruijn words (Q2113383) (← links)
- Operational complexity and pumping lemmas (Q2170280) (← links)
- Block reversal on finite words (Q2243589) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- Counting (Watson-Crick) palindromes in Watson-Crick conjugates (Q2672245) (← links)
- Undecidability of state complexity (Q2855756) (← links)
- Complexity in union-free regular languages (Q2909101) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- (Q5020533) (← links)
- A Study of a Simple Class of Modifiers: Product Modifiers (Q5041253) (← links)
- Operations on Permutation Automata (Q5041254) (← links)
- (Q5130744) (← links)
- Further closure properties of input-driven pushdown automata (Q5919707) (← links)
- Nondeterministic operational complexity in subregular languages (Q6093571) (← links)
- Further Remarks on the Operational Nonterminal Complexity (Q6114830) (← links)