28 citations · 43 across the 11 of their papers we have counts for
4 papers · 1 filter
Extensions of -Regular Languages
Mikołaj Bojańczyk, Edon Kelmendi, Rafał Stefański +1
We consider extensions of monadic second order logic over -words, which are obtained by adding one language that is not -regular. We show that if the added language has a…
Emptiness of zero automata is decidable
Mikolaj Bojańczyk, Hugo Gimbert, Edon Kelmendi
Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability of a certain probabilistic variant of mso, called tmso + zero, reduces to the e…
Deciding the value 1 problem for probabilistic leaktight automata
Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi +1
The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close…
Deciding the Value 1 Problem of Probabilistic Leaktight Automata
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril…