首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Independent sets of words and the synchronization problem
Authors:Arturo Carpi  Flavio DʼAlessandro
Institution:1. Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, via Vanvitelli 1, 06123 Perugia, Italy;2. Dipartimento di Matematica, Università di Roma “La Sapienza”, Piazzale Aldo Moro 2, 00185 Roma, Italy;3. Department of Mathematics, Bo?aziçi University, 34342 Bebek, Istanbul, Turkey
Abstract:The synchronization problem is investigated for the class of locally strongly transitive automata introduced in Carpi and D?Alessandro (2009) 9]. Some extensions of this problem related to the notions of stable set and word of minimal rank of an automaton are studied. An application to synchronizing colorings of aperiodic graphs with a Hamiltonian path is also considered.
Keywords:68Q45  05C15  05C45
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号