Stamina: stabilisation monoids in automata theory
From MaRDI portal
Publication:2399252
Recommendations
Cites work
- ACME: automata with counters, monoids and equivalence
- Algorithms for determining relative star height and star height
- Deciding the value 1 problem for probabilistic leaktight automata
- Deciding the value 1 problem for probabilistic leaktight automata
- Deciding the weak definability of Büchi definable tree languages
- Distance desert automata and the star height problem
- scientific article; zbMATH DE number 2086220 (Why is no real title available?)
- On semigroups of matrices over the tropical semiring
- Probabilistic automata
- Regular cost functions. I: Logic and algebra over words
- Star height of certain families of regular events
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Transition graphs and the star-height of regular events
Cited in
(4)
This page was built for publication: Stamina: stabilisation monoids in automata theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399252)