The transformation monoid of a partially lossy queue

DOI10.1007/978-3-319-58747-9_18zbMath1489.68063OpenAlexW2611354137MaRDI QIDQ2399374

Chris Köcher, Dietrich Kuske

Publication date: 22 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58747-9_18

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Data structures (68P05)

Related Items (2)

The inclusion structure of partially lossy queue monoids and their trace submonoids ⋮ Bounded Context Switching for Valence Systems

Cites Work

• Unnamed Item
• A note on the commutative closure of star-free languages
• Combinatorics on traces
• Unreliable channels are easier to verify than perfect channels
• Verifying programs with unreliable channels
• The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids
• The Monoid of Queue Actions
• Formal Languages and Groups as Memory
• On Communicating Finite-State Machines
• The Power of Priority Channel Systems

This page was built for publication: The transformation monoid of a partially lossy queue