Infinite hierarchy of expressions containing shuffle closure operator

DOI10.1016/0020-0190(88)90140-8zbMATH Open0652.68092OpenAlexW2047231602MaRDI QIDQ1107331FDOQ1107331

Authors: Joanna Jȩdrzejowicz 

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90140-8

Recommendations

• Infinite hierarchy of shuffle expressions over a finite alphabet
• Infinite hierarchy of permutation languages
• The expressive power of the shuffle product
• Nesting of shuffle closure is important
• scientific article; zbMATH DE number 929652
• The infinitary \(n\)-cube shuffle
• There is no complete axiom system for shuffle expressions
• scientific article; zbMATH DE number 1086499
• Shuffle Expressions and Words with Nested Data
• Infinite unfair shuffles and associativity

zbMATH Keywords

shuffle languagesshuffle closuredepth hierarchy

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Shuffle languages, Petri nets, and context-sensitive grammars
• Extending regular expressions with iterated shuffle
• On the enlargement of the class of regular languages by the shuffle closure
• Relations of flow languages to Petri net languages
• Nesting of shuffle closure is important

Cited In (3)

• Infinite hierarchy of shuffle expressions over a finite alphabet
• Nesting of shuffle closure is important
• There is no complete axiom system for shuffle expressions

This page was built for publication: Infinite hierarchy of expressions containing shuffle closure operator

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