On the synchronization of planar automata
Formal Languages and Automata Theory
2016-12-15 v1
Abstract
Planar automata seems to be representative of the synchronizing behavior of deterministic finite state automata. We conjecture that \v{C}erny's conjecture holds true, if and only if, it holds true for planar automata. In this paper we have gathered some evidence concerning this conjecture. This evidence amounts to show that the class of planar automata is representative of the algorithmic hardness of synchronization
Keywords
Cite
@article{arxiv.1612.04462,
title = {On the synchronization of planar automata},
author = {J. Andres Montoya and Christian Nolasco},
journal= {arXiv preprint arXiv:1612.04462},
year = {2016}
}
Comments
17 pages, 2 figures