Mariusz Grech ; Andrzej Kisielewicz - The Cerný conjecture for automata respecting intervals of a directed graph

dmtcs:619 - Discrete Mathematics & Theoretical Computer Science, November 3, 2013, Vol. 15 no. 3 - https://doi.org/10.46298/dmtcs.619
The Cerný conjecture for automata respecting intervals of a directed graphArticle

Authors: Mariusz Grech ORCID1; Andrzej Kisielewicz 1

  • 1 Mathematical Institute [Wroclaw]

Automata, Logic and Semantics

[en]
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.

https://doi.org/10.46298/dmtcs.619
Source: HAL:hal-00966381v1
Volume: Vol. 15 no. 3
Section: Automata, Logic and Semantics
Published on: November 3, 2013
Imported on: July 11, 2012
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

3 Documents citing this article

Share and export

Consultation statistics

This page has been seen 716 times.
This article's PDF has been downloaded 501 times.