State complexity of cyclic shift
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7301304
- State complexity and approximation
- scientific article; zbMATH DE number 2201361
- State complexity of pseudocatenation
- On the complexity of a cyclic shift of a set of real numbers
- Finite state complexity
- State complexity of code operators
- State complexity of insertion
- State complexity of inversion operations
- State complexity of inversion operations
Cites work
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- A lower bound technique for the size of nondeterministic finite automata
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1011685 (Why is no real title available?)
- scientific article; zbMATH DE number 2068872 (Why is no real title available?)
- scientific article; zbMATH DE number 2068873 (Why is no real title available?)
- scientific article; zbMATH DE number 2068876 (Why is no real title available?)
- scientific article; zbMATH DE number 2182451 (Why is no real title available?)
- scientific article; zbMATH DE number 1916664 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- Intersection and union of regular languages and state complexity
- MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
- Magic Numbers in the State Hierarchy of Finite Automata
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- On the state complexity of reversals of regular languages
- Partial orders on words, minimal elements of regular languages, and state complexity
- State complexity of combined operations
- State complexity of some operations on binary regular languages
- The state complexities of some basic operations on regular languages
Cited in
(23)- Descriptional complexity of regular languages
- Combination of roots and Boolean operations: an application to state complexity
- Maximal state complexity and generalized de Bruijn words
- Operational complexity and pumping lemmas
- Generalized de Bruijn words and the state complexity of conjugate sets
- Block reversal on finite words
- Language operations with regular expressions of polynomial size
- Nondeterministic complexity in subclasses of convex languages
- Counting (Watson-Crick) palindromes in Watson-Crick conjugates
- Undecidability of state complexity
- Complexity in union-free regular languages
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- Cyclic shift on prefix-free languages
- Algebraic and combinatorial tools for state complexity: application to the star-xor problem
- A Study of a Simple Class of Modifiers: Product Modifiers
- Operations on Permutation Automata
- New tools for state complexity
- Further closure properties of input-driven pushdown automata
- scientific article; zbMATH DE number 7770054 (Why is no real title available?)
- Nondeterministic operational complexity in subregular languages
- Further Remarks on the Operational Nonterminal Complexity
- Watson-Crick conjugates of words and languages
This page was built for publication: State complexity of cyclic shift
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3515466)
