Author(s)

Avraham N. Trahtman

Department of Mathematics, Bar-Ilan University, Ramat Gan, Israel.

The work presents some new algorithms realized recently in the package TESTAS. The package decides whether or not DFA is synchronizing, several procedures find relatively short synchronizing words and a synchronizing word of the minimal length. We check whether or not a directed graph has a road coloring that turns the graph into a synchronizing deterministic finite automaton (DFA). The algorithm finds the 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.

Finite Automaton; Synchronizing Word; Algorithm; Visualization

A. Trahtman, "Some New Features and Algorithms for the Study of DFA," Open Journal of Discrete Mathematics, Vol. 2 No. 2, 2012, pp. 45-50. doi: 10.4236/ojdm.2012.22008.