Nonfinite axiomatizability of shuffle inequalities

DOI10.1007/3-540-59293-8_204MaRDI QIDQ5096740zbMATH OpenOpenAlexFDO

Authors Stephen L. Bloom, Zoltán Ésik

Publication date 18 August 2022

Published in TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59293-8_204

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 1638641 (Why is no real title available?)
• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• Free shuffle algebras in language varieties
• Modeling concurrency with partial orders
• Nonfinite axiomatizability of the equational theory of shuffle
• The Recognition of Series Parallel Digraphs
• The equational theory of pomsets
• Towards action-refinement in process algebras
• Varieties of ordered algebras

Cited in

(7)

• Axiomatizing shuffle and concatenation in languages
• Shuffle and scattered deletion closure of languages
• Free shuffle algebras in language varieties
• Long words: The theory of concatenation and \(\omega\)-power
• The quest for equational axiomatizations of parallel composition: status and open problems
• There is no complete axiom system for shuffle expressions
• Nonfinite axiomatizability of the equational theory of shuffle

This page was built for publication: Nonfinite axiomatizability of shuffle inequalities

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