Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Idir, Olivier"'
We define the class of explorable automata on finite or infinite words. This is a generalization of History-Deterministic (HD) automata, where this time non-deterministic choices can be resolved by building finitely many simultaneous runs instead of
Externí odkaz:
http://arxiv.org/abs/2410.23187
We present a polynomial-time algorithm minimising the number of states of history-deterministic generalised coB\"uchi automata, building on the work of Abu Radi and Kupferman on coB\"uchi automata. On the other hand, we establish that the minimisatio
Externí odkaz:
http://arxiv.org/abs/2407.18090