Nonfinite axiomatizability of the equational theory of shuffle

DOI10.1007/3-540-60084-1_60zbMath1412.68141OpenAlexW1567957328MaRDI QIDQ4645164

Michael Bertol, Zoltán Ésik

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_60

zbMATH Keywords

free algebraequational theoryprincipal idealclosed idealopen vertex

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (4)

Axiomatizing shuffle and concatenation in languages ⋮ Free shuffle algebras in language varieties extended abstract ⋮ Nonfinite axiomatizability of shuffle inequalities ⋮ The variety of Kleene algebras with conversion is not finitely based

Cites Work

• Modeling concurrency with partial orders
• The equational theory of pomsets
• Complete systems of \(\mathcal B\)-rational identities
• Varieties of ordered algebras
• A completeness theorem for Kleene algebras and the algebra of regular events
• Towards action-refinement in process algebras
• Complexity Results for POMSET Languages
• Une remarque sur les systèmes complets d'identités rationnelles
• The Recognition of Series Parallel Digraphs
• Equational axioms for regular sets
• Nonfinite axiomatizability of shuffle inequalities
• Two Complete Axiom Systems for the Algebra of Regular Events
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonfinite axiomatizability of the equational theory of shuffle