Nonfinite axiomatizability of the equational theory of shuffle
From MaRDI portal
Publication:1130164
DOI10.1007/s002360050129zbMath0903.68114OpenAlexW1975572112MaRDI QIDQ1130164
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
Related Items (7)
Shuffled languages -- representation and recognition ⋮ Free shuffle algebras in language varieties ⋮ CCS with Hennessy's merge has no finite-equational axiomatization ⋮ Lifting non-finite axiomatizability results to extensions of process algebras ⋮ Shuffle and scattered deletion closure of languages ⋮ The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems ⋮ The max-plus algebra of the natural numbers has no finite equational basis
This page was built for publication: Nonfinite axiomatizability of the equational theory of shuffle
