some new features and algorithms for the study of dfa一些新功能和算法研究dfa.pdf

Open Journal of Discrete Mathematics, 2012, 2, 45-50 /10.4236/ojdm.2012.22008 Published Online April 2012 (http://www.SciRP.org/journal/ojdm) Some New Features and Algorithms for the Study of DFA Avraham N. Trahtman Department of Mathematics, Bar-Ilan University, Ramat Gan, Israel Email: avraham.trakhtman@ Received December 1, 2011; revised January 20, 2012; accepted February 17, 2012 ABSTRACT 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. Keywords: Finite Automaton; Synchronizing Word; Algorithm; Visualization 1. Introduction studied objects was about 1020 . Imagine a map with roads which are colored in such a The problem of synchronization of a DFA is natural and way that fixed sequence of colors, called a synchronizing various aspects of this problem were touched upon the sequence, leads to fixed place whatever is the starting literature. Synchronization makes the behavior of an