This paper mainly concerns the property of strong local transitivity of finite automata. We will survey some results on this property in the context of the synchronization problem. Further aspects and results relating this problem with the Road coloring problem of finite directed graphs and the Restivo conjecture on the minimal length of an incompletable word of a finite language, are also analyzed.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | Locally strongly transitive automata in the Černý conjecture and related problems |
Autori: | |
Data di pubblicazione: | 2019 |
Rivista: | |
Abstract: | This paper mainly concerns the property of strong local transitivity of finite automata. We will ...survey some results on this property in the context of the synchronization problem. Further aspects and results relating this problem with the Road coloring problem of finite directed graphs and the Restivo conjecture on the minimal length of an incompletable word of a finite language, are also analyzed. |
Handle: | http://hdl.handle.net/11391/1459974 |
Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.