Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Hazard, Emile"'
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
Autor:
Hazard, Emile, Kuperberg, Denis
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4607482404224467290e63028b000b0