Stamina: stabilisation monoids in automata theory
From MaRDI portal
Publication:2399252
DOI10.1007/978-3-319-60134-2_9zbMath1489.68124OpenAlexW2617036142MaRDI QIDQ2399252
Edon Kelmendi, Hugo Gimbert, Nathanaël Fijalkow, Denis Kuperberg
Publication date: 22 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-60134-2_9
Formal languages and automata (68Q45) Software, source code, etc. for problems pertaining to computer science (68-04)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for determining relative star height and star height
- Transition graphs and the star-height of regular events
- Star height of certain families of regular events
- Regular Cost Functions, Part I: Logic and Algebra over Words
- Deciding the value 1 problem for probabilistic leaktight automata
- Deciding the Value 1 Problem for Probabilistic Leaktight Automata
- ACME: Automata with Counters, Monoids and Equivalence
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
- The Theory of Stabilisation Monoids and Regular Cost Functions
- On semigroups of matrices over the tropical semiring
- Distance desert automata and the star height problem
- Probabilistic automata
This page was built for publication: Stamina: stabilisation monoids in automata theory