Semirings, automata, languages
Semirings, automata, languages
Nesting of shuffle closure is important0
Information Processing Letters
Infinite hierarchy of expressions containing shuffle closure operator
Information Processing Letters
Axiomatizing shuffle and concatenation in languages
Information and Computation
Shuffle languages, Petri nets, and context-sensitive grammars
Communications of the ACM
Nonfinite Axiomatizability of the Equational Theory of Shuffle
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Shuffle Quotient and Decompositions
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Algebraic Theory of Automata & Languages
Algebraic Theory of Automata & Languages
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
The expressive power of the shuffle product
Information and Computation
Partially-commutative context-free processes: Expressibility and tractability
Information and Computation
Recognizing shuffled languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
On a hierarchy of languages with catenation and shuffle
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On Semilinear Sets over Commutative Semirings
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Iteration Lemmata for Certain Classes of Word, Trace and Graph Languages
Fundamenta Informaticae
| Hi-index | 0.00 |
We present basic structures, definitions, normal forms, and a hierarchy of languages based on catenation, shuffle and their iterations, defined by algebraic closures or least fixed point solutions to systems of equations.