Formal languages
A Polynomial time Algorithm for the Local Testability Problem of Deterministic Finite Automata
IEEE Transactions on Computers
The state complexities of some basic operations on regular languages
Theoretical Computer Science
Computing the Order of a Locally Testable Automaton
SIAM Journal on Computing
Handbook of formal languages, vol. 1
Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
Optimal estimation on the order of local testability of finite automata
Theoretical Computer Science - Special issue on implementing automata
Families of locally testable languages
Theoretical Computer Science
Shuffle and scattered deletion closure of languages
Theoretical Computer Science
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Tight lower bound for the state complexity of shuffle of regular languages
Journal of Automata, Languages and Combinatorics
Shuffle-like Operations on omega-words
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Tight lower bound for the state complexity of shuffle of regular languages
Journal of Automata, Languages and Combinatorics
Concurrency, Synchronization, and Conflicts in Petri Nets
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the uniqueness of shuffle on words and finite languages
Theoretical Computer Science
On a hierarchy of languages with catenation and shuffle
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
A Hierarchy of Languages with Catenation and Shuffle
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.01 |
We introduce a right congruence relation that is the analogy of the Nerode congruence when catenation is replaced by shuffle. Using this relation we show that for certain subclasses of regular languages the shuffle decomposition problem is decidable. We show that shuffle decomposition is undecidable for context-free languages.