Stamina: Stabilisation Monoids IN Automata theory - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Stamina: Stabilisation Monoids IN Automata theory

Résumé

We present Stamina, a tool solving three algorithmic problems in au-tomata 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. All three problems reduce to the computation of the stabilisation monoid associated with an automaton, which is computationally challenging because the monoid is exponentially larger than the automaton. The compact data structures used in Stamina, together with optimisations and heuristics, allow us to handle automata with several hundreds of states. This radically improves upon the performances of ACME, a similar tool solving a subset of these problems. The tool Stamina is open source and available from Github, details are given on the webpage http://stamina.labri.fr.
Fichier principal
Vignette du fichier
main.pdf (224.19 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01891164 , version 1 (09-10-2018)

Identifiants

  • HAL Id : hal-01891164 , version 1

Citer

Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg. Stamina: Stabilisation Monoids IN Automata theory. CIAA - International Conference on Implementation and Application of Automata, 2017, Marne-la-Vallée, France. ⟨hal-01891164⟩
96 Consultations
70 Téléchargements

Partager

Gmail Facebook X LinkedIn More