Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-00966381
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, March 26, 2014 - 3:16:27 PM
Last modification on : Saturday, November 21, 2020 - 9:54:03 AM
Long-term archiving on: : Thursday, June 26, 2014 - 11:32:04 AM

File

2198-8396-1-PB.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

67

Files downloads

782