Rational, recognizable, and aperiodic partially lossy queue languages

DOI10.1142/S0218196722500230OpenAlexW4214657356MaRDI QIDQ5075703

Chris Köcher

Publication date: 11 May 2022

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196722500230

zbMATH Keywords

MSO logictransformation monoidrecognizable setsrational setsaperiodic setspartially lossy queues

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the commutative closure of star-free languages
• Elements of finite model theory.
• Rational subsets of polycyclic monoids and valence automata
• On the decidability of some problems about rational subsets of free partially commutative monoids
• Classifying regular events in symbolic logic
• Space-bounded reducibility among combinatorial problems
• 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
• On Communicating Finite-State Machines
• The inclusion structure of partially lossy queue monoids and their trace submonoids
• On finite monoids having only trivial subgroups
• A variant of a recursively unsolvable problem

This page was built for publication: Rational, recognizable, and aperiodic partially lossy queue languages