Operations on Permutation Automata
From MaRDI portal
Recommendations
- On the accepting state complexity of operations on permutation automata
- On the accepting state complexity of operations on permutation automata
- The state complexity of permutations on finite languages over binary alphabets
- Permutation automata
- State complexity of some operations on binary regular languages
Cites work
- Complexity in union-free regular languages
- Complexity of Operations on Cofinite Languages
- Cuts in regular expressions
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 2081044 (Why is no real title available?)
- scientific article; zbMATH DE number 1418342 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- Kleene closure and state complexity
- NFA-to-DFA trade-off for regular operations
- Permutation automata
- Quotient complexity of ideal languages
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
- State complexity of basic operations on suffix-free regular languages
- State complexity of cyclic shift
- The range of state complexities of languages resulting from the cut operation
- The state complexities of some basic operations on regular languages
- The state complexity of \(L^{2}\) and \(L^k\)
- Tight bounds for cut-operations on deterministic finite automata
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Cited in
(20)- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
- Closure properties of subregular languages under operations
- Performing regular operations with 1-limited automata
- Operations on Self-Verifying Finite Automata
- scientific article; zbMATH DE number 1452989 (Why is no real title available?)
- Applications of the finite state automata for counting restricted permutations and variations
- Permutation automata
- State complexity bounds for the commutative closure of group languages
- Nondeterministic operational complexity in subregular languages
- On the accepting state complexity of operations on permutation automata
- On the accepting state complexity of operations on permutation automata
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages
- Decision problems for reversible and permutation automata
- Sweeping permutation automata
- A hierarchy of reversible finite automata
- Closure properties of subregular languages under operations
- Ordered context-free grammars revisited
- Language membership problems for subregular classes
- Decision problems for reversible and permutation automata
- State complexity of projection on languages recognized by permutation automata and commuting letters
This page was built for publication: Operations on Permutation Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041254)
