Nonfinite axiomatizability of the equational theory of shuffle

DOI10.1007/S002360050129zbMATH Open0903.68114OpenAlexW1975572112MaRDI QIDQ1130164FDOQ1130164

Authors: Michael Bertol, Zoltán Ésik 

Publication date: 20 August 1998

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050129

Recommendations

• Nonfinite axiomatizability of the equational theory of shuffle
• Axiomatizing shuffle and concatenation in languages
• Nonfinite axiomatizability of shuffle inequalities
• There is no complete axiom system for shuffle expressions
• Free shuffle algebras in language varieties

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (14)

• Lifting non-finite axiomatizability results to extensions of process algebras
• Shuffle and scattered deletion closure of languages
• The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
• Shuffle on positive varieties of languages
• On shuffle ideals of general algebras
• Free shuffle algebras in language varieties
• CCS with Hennessy's merge has no finite-equational axiomatization
• Title not available (Why is that?)
• The max-plus algebra of the natural numbers has no finite equational basis
• Nonfinite axiomatizability of shuffle inequalities
• The quest for equational axiomatizations of parallel composition: status and open problems
• There is no complete axiom system for shuffle expressions
• Shuffled languages -- representation and recognition
• Nonfinite axiomatizability of the equational theory of shuffle

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

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