The Cerný conjecture for automata respecting intervals of a directed graph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2013

The Cerný conjecture for automata respecting intervals of a directed graph

Abstract

The Cerný's conjecture states that for every synchronizing automaton with n states there exists a reset word of length not exceeding (n - 1)2. We prove this conjecture for a class of automata preserving certain properties of intervals of a directed graph. Our result unifies and generalizes some earlier results obtained by other authors.
Fichier principal
Vignette du fichier
2198-8396-1-PB.pdf (136.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00966381 , version 1 (26-03-2014)

Identifiers

Cite

Mariusz Grech, Andrzej Kisielewicz. The Cerný conjecture for automata respecting intervals of a directed graph. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 3 (3), pp.61--72. ⟨10.46298/dmtcs.619⟩. ⟨hal-00966381⟩

Collections

TDS-MACS
74 View
1024 Download

Altmetric

Share

Gmail Facebook X LinkedIn More