Rational, recognizable, and aperiodic partially lossy queue languages

DOI10.1142/S0218196722500230MaRDI QIDQ5075703zbMATH OpenOpenAlexFDO

Authors 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

aperiodic setsMSO logicpartially lossy queuesrational setsrecognizable setstransformation monoid

Mathematics Subject Classification ID

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

Recommendations

• Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
• The Monoid of Queue Actions
• The monoid of queue actions
• The transformation monoid of a partially lossy queue
• The inclusion structure of partially lossy queue monoids and their trace submonoids

Cites work

• A note on the commutative closure of star-free languages
• A variant of a recursively unsolvable problem
• Classifying regular events in symbolic logic
• Elements of finite model theory.
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 176495 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 3557223 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 1929967 (Why is no real title available?)
• scientific article; zbMATH DE number 4003548 (Why is no real title available?)
• scientific article; zbMATH DE number 3328203 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• Kleene quotient theorems
• Monoids as storage mechanisms
• On Communicating Finite-State Machines
• On finite monoids having only trivial subgroups
• On the decidability of some problems about rational subsets of free partially commutative monoids
• Rational subsets of polycyclic monoids and valence automata
• Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
• Space-bounded reducibility among combinatorial problems
• The inclusion structure of partially lossy queue monoids and their trace submonoids
• The monoid of queue actions
• The rational subset membership problem for groups: a survey
• Unreliable channels are easier to verify than perfect channels
• Verifying programs with unreliable channels
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(5)

• The monoid of queue actions
• Reachability problems on partially lossy queue automata
• The transformation monoid of a partially lossy queue
• Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
• The inclusion structure of partially lossy queue monoids and their trace submonoids

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075703)