Nonfinite axiomatizability of shuffle inequalities

DOI10.1007/3-540-59293-8_204zbMath1496.68206OpenAlexW2100544365MaRDI QIDQ5096740

Zoltán Ésik, Stephen L. Bloom

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)

Related Items (6)

Nonfinite axiomatizability of the equational theory of shuffle ⋮ Axiomatizing shuffle and concatenation in languages ⋮ Free shuffle algebras in language varieties ⋮ Long words: The theory of concatenation and \(\omega\)-power ⋮ Shuffle and scattered deletion closure of languages ⋮ The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Free shuffle algebras in language varieties
• Modeling concurrency with partial orders
• The equational theory of pomsets
• Varieties of ordered algebras
• Towards action-refinement in process algebras
• The Recognition of Series Parallel Digraphs
• Nonfinite axiomatizability of the equational theory of shuffle

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