Infinite hierarchy of expressions containing shuffle closure operator

DOI10.1016/0020-0190(88)90140-8zbMath0652.68092OpenAlexW2047231602MaRDI QIDQ1107331

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

zbMATH Keywords

shuffle languagesshuffle closuredepth hierarchy

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Infinite hierarchy of shuffle expressions over a finite alphabet

Cites Work

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

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