Axiomatizing shuffle and concatenation in languages

DOI10.1006/inco.1997.2665zbMath0892.68055OpenAlexW2061007349MaRDI QIDQ1383153

Zoltán Ésik, Stephen L. Bloom

Publication date: 4 May 1998

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1997.2665

zbMATH Keywords

variety \({\mathbf L}{\mathbf a}{\mathbf n}{\mathbf g}\)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On Kedlaya-type inequalities for weighted means ⋮ Shuffled languages -- representation and recognition ⋮ On Hardy-type inequalities for weighted means ⋮ CCS with Hennessy's merge has no finite-equational axiomatization ⋮ There is no complete axiom system for shuffle expressions ⋮ The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Free shuffle algebras in language varieties
• Failures semantics based on interval semiwords is a congruence for refinement
• The equational theory of pomsets
• Varieties of ordered algebras
• Shuffle languages, Petri nets, and context-sensitive grammars
• The Recognition of Series Parallel Digraphs
• Equational axioms for regular sets
• Languages under concatenation and shuffling
• Nonfinite axiomatizability of the equational theory of shuffle
• Nonfinite axiomatizability of shuffle inequalities