scientific article

DOI10.4230/LIPIcs.STACS.2018.45zbMath1487.68162MaRDI QIDQ3304144

Chris Köcher

Publication date: 5 August 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

MSO logictransformation monoidrecognizable setsrational setsaperiodic setspartially lossy queues

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (5)

Reachability problems on reliable and lossy queue automata ⋮ 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
• A note on the commutative closure of star-free languages
• Rational subsets of polycyclic monoids and valence automata
• On the decidability of some problems about rational subsets of free partially commutative monoids
• The monoid of queue actions
• Unreliable channels are easier to verify than perfect channels
• Verifying programs with unreliable channels
• Kleene quotient theorems
• The rational subset membership problem for groups: a survey
• Weak Second‐Order Arithmetic and Finite Automata
• Formal Languages and Groups as Memory
• On Communicating Finite-State Machines
• On finite monoids having only trivial subgroups
• A variant of a recursively unsolvable problem

This page was built for publication: