Name
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. |
Year | Venue | Field |
|---|---|---|
2017 | CIAA | Discrete mathematics,Automata theory,Regular expression,Star height,Computer science,Automaton,Monoid,Probabilistic logic,Regular language |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
9 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathanaël Fijalkow | 1 | 61 | 19.71 |
| Gimbert, H. | 2 | 5 | 3.21 |
| Edon Kelmendi | 3 | 20 | 5.34 |
| Denis Kuperberg | 4 | 41 | 9.68 |