SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
From MaRDI portal
Recommendations
Cites work
- Computing the Order of a Locally Testable Automaton
- Extending regular expressions with iterated shuffle
- Families of locally testable languages
- Optimal estimation on the order of local testability of finite automata
- Shuffle and scattered deletion closure of languages
- Shuffle factorization is unique
- Shuffle languages are in P
- Shuffle on trajectories: Syntactic constraints
- Thin and slender languages
Cited in
(20)- Language equations
- Regularity conditions for iterated shuffle on commutative regular languages
- Decidability of trajectory-based equations
- Quotients of unbounded parallelism
- On the State Complexity of the Shuffle of Regular Languages
- On language decompositions and primality
- scientific article; zbMATH DE number 992018 (Why is no real title available?)
- On the itarated shuffle of some regular languages
- Language Decompositions, Primality, and Trajectory-Based Operations
- Tree shuffle
- scientific article; zbMATH DE number 1222104 (Why is no real title available?)
- scientific article; zbMATH DE number 2087222 (Why is no real title available?)
- scientific article; zbMATH DE number 1916664 (Why is no real title available?)
- On shuffling a word with its letter-to-letter substitution
- Shuffle decomposition of regular languages
- RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
- Deletion along trajectories
- Algorithmic decomposition of shuffle on words
- On the enlargement of the class of regular languages by the shuffle closure
- On the uniqueness of shuffle on words and finite languages
This page was built for publication: SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3021987)
