Independent sets of words and the synchronization problem
From MaRDI portal
Publication:1940419
DOI10.1016/j.aam.2012.07.003zbMath1266.68128arXiv1111.5467OpenAlexW1973858274MaRDI QIDQ1940419
Arturo Carpi, Flavio D'Alessandro
Publication date: 6 March 2013
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.5467
Formal languages and automata (68Q45) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (6)
On the length of uncompletable words in unambiguous automata ⋮ On incomplete and synchronizing finite sets ⋮ Algebraic synchronization criterion and computing reset words ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata ⋮ Experiments with Synchronizing Automata
This page was built for publication: Independent sets of words and the synchronization problem
