@inproceedings{10.1007/978-3-319-60134-2_9,
Abstract = {We present Stamina, a tool solving three algorithmic problems in automata theory. First, compute the star height of a regular language, i.e. the minimal number of nested Kleene stars needed for expressing the language with a complement-free regular expression. Second, decide limitedness for regular cost functions. Third, decide whether a probabilistic leaktight automaton has value 1, i.e. whether a probabilistic leaktight automaton accepts words with probability arbitrarily close to 1.},
Address = {Cham},
Author = {Fijalkow, Nathana{\"e}l and Gimbert, Hugo and Kelmendi, Edon and Kuperberg, Denis},
BookTitle = {Implementation and Application of Automata},
Editor = {Carayol, Arnaud and Nicaud, Cyril},
File = {Fijalkow2017\_Chapter\_StaminaStabilisationMonoidsInA (0) - a - a - a.pdf},
ISBN = {978-3-319-60134-2},
Pages = {101--112},
Publisher = {Springer International Publishing},
Title = {Stamina: Stabilisation Monoids in Automata Theory},
Year = {2017},
bdsk-url-1 = {https://github.com/nathanael-fijalkow/stamina/},
date-added = {2018-10-11 16:22:55 +0000},
date-modified = {2018-10-11 16:22:55 +0000},
doi = {10.1007/978-3-319-60134-2_9}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A