The monoid of queue actions

DOI10.1007/s00233-016-9835-4zbMath1400.68094OpenAlexW3022103681MaRDI QIDQ1702520

Dietrich Kuske, Martin Huschenbett, Georg Zetzsche

Publication date: 28 February 2018

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-016-9835-4

zbMATH Keywords

semi-Thue systemconjugacy problemautomaticityrecognizable and rational subsets

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03) Algebraic monoids (20M32)

Related Items (6)

Reachability problems on reliable and lossy queue automata ⋮ Unnamed Item ⋮ The inclusion structure of partially lossy queue monoids and their trace submonoids ⋮ Rational, recognizable, and aperiodic partially lossy queue languages ⋮ Bounded Context Switching for Valence Systems ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synchronized rational relations of finite and infinite words
• Conjugacy in monoids with a special Church-Rosser presentation is decidable
• On some equations in free partially commutative monoids
• Conjugacy in special monoids
• Automatic semigroups
• Finite presentations of infinite structures: Automata and interpretations
• From automatic structures to automatic groups.
• The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids
• The Monoid of Queue Actions
• The rational subset membership problem for groups: a survey
• CONJUGACY IN FREE INVERSE MONOIDS
• Formal Languages and Groups as Memory
• Automatic monoids and change of generators

This page was built for publication: The monoid of queue actions