Some new Features and Algorithms for the Study of DFA
Formal Languages and Automata Theory
2020-11-12 v1
Abstract
The work presents some new algorithms realized recently in the package TESTAS. They decide whether or not deterministic finite automaton (DFA) is synchronizing, several procedures find relatively short synchronizing words and a synchronizing word of the minimal length. We check the existence of a coloring of directed graph that turns the graph into a synchronizing DFA. The algorithm finds the coloring (better known as the road coloring) if it exists. Otherwise, the k-synchronizing road coloring can be found. We use a linear visualization of the graph of an automaton based on its structural properties.
Cite
@article{arxiv.2011.05575,
title = {Some new Features and Algorithms for the Study of DFA},
author = {Avraham N. Trahtman},
journal= {arXiv preprint arXiv:2011.05575},
year = {2020}
}
Comments
9 pages, 2 figures, 2 tables. arXiv admin note: substantial text overlap with arXiv:0907.2755