Languages under concatenation and shuffling

DOI10.1017/S0960129500000578zbMath0829.68077OpenAlexW2171876361MaRDI QIDQ4327410

Steven T. Tschantz

Publication date: 6 April 1995

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129500000578

zbMATH Keywords

partial ordersgeneralized shuffling operations on languages

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (5)

Axiomatizing shuffle and concatenation in languages ⋮ Free shuffle algebras in language varieties ⋮ Shuffles and concatenations in the construction of graphs ⋮ CCS with Hennessy's merge has no finite-equational axiomatization ⋮ The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems

Cites Work

• The equational theory of pomsets
• The Recognition of Series Parallel Digraphs

This page was built for publication: Languages under concatenation and shuffling