Strongly transitive automata and the Černý conjecture

Authors:
Arturo Carpi;Flavio D’Alessandro
Affiliations:
Università degli Studi di Perugia, Dipartimento di Matematica e Informatica, via Vanvitelli 1, 06123, Perugia, Italy;Università di Roma “La Sapienza”, Dipartimento di Matematica, Piazzale Aldo Moro 2, 00185, Rome, Italy
Venue:
Acta Informatica
Year:
2009

Citing 0
Cited 3

On a conjecture by Carpi and D'Alessandro

DLT'10 Proceedings of the 14th international conference on Developments in language theory
On the hybrid Černý-road coloring problem and Hamiltonian paths

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Automata with extremal minimality conditions

DLT'10 Proceedings of the 14th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The synchronization problem is investigated for a new class of deterministic automata called strongly transitive. An extension to unambiguous automata is also considered.