Shuffle decomposition of regular languages

MaRDI QIDQ5422237zbMATH OpenFDO

Authors Masami Ito

Publication date 17 October 2007

Full work available at URL http://www.jucs.org/jucs_8_2/shuffle_decomposition_of_regular

zbMATH Keywords

regular languageshuffle decompositionshuffle product

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• scientific article; zbMATH DE number 2087222
• RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
• Algorithmic decomposition of shuffle on words
• A non-ambiguous decomposition of regular languages and factorizing codes

Cited in

(17)

• Regular component splittable languages
• Mixed languages
• Regular component decomposition of regular languages.
• Regularity conditions for iterated shuffle on commutative regular languages
• Decidability of trajectory-based equations
• On the State Complexity of the Shuffle of Regular Languages
• On language decompositions and primality
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• Language Decompositions, Primality, and Trajectory-Based Operations
• Concurrency, Synchronization, and Conflicts in Petri Nets
• Tree shuffle
• scientific article; zbMATH DE number 2087222 (Why is no real title available?)
• scientific article; zbMATH DE number 1916664 (Why is no real title available?)
• Partial Derivative Automaton for Regular Expressions with Shuffle
• RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
• Algorithmic decomposition of shuffle on words
• On the uniqueness of shuffle on words and finite languages

This page was built for publication: Shuffle decomposition of regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422237)