The Cayley-graph of the queue monoid: logic and decidability
From MaRDI portal
Recommendations
Cites work
- An application of games to the completeness problem for formalized theories
- Automatic structures of bounded degree revisited
- Finite model theory and its applications.
- Formal Languages and Groups as Memory
- Formal Models of Communicating Systems
- From automatic structures to automatic groups.
- Graph minors. III. Planar tree-width
- scientific article; zbMATH DE number 3115890 (Why is no real title available?)
- scientific article; zbMATH DE number 4039338 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 1929967 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 806750 (Why is no real title available?)
- Logical aspects of Cayley-graphs: the group case
- LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
- Mathematical Foundations of Computer Science 2003
- On Communicating Finite-State Machines
- On the structure of semigroups
- Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
- Some results on equational unification
- The computational complexity of logical theories
- The inclusion structure of partially lossy queue monoids and their trace submonoids
- The monoid of queue actions
- The power of priority channel systems
- The structure of the models of decidable monadic theories of graphs
- The theory of ends, pushdown automata, and second-order logic
- Unreliable channels are easier to verify than perfect channels
- Verifying programs with unreliable channels
This page was built for publication: The Cayley-graph of the queue monoid: logic and decidability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090942)
