J. Ellson, E. Gansner and L. Koutsofios, “GraphViz— Open Source Graph Drawing Tools,” Graph Drawing, Vol. 2265, 2002, pp. 594-597. doi:10.1007/3-540-45848-4_57
has been cited by the following article:
TITLE: Some New Features and Algorithms for the Study of DFA
AUTHORS: Avraham N. Trahtman
KEYWORDS: Finite Automaton; Synchronizing Word; Algorithm; Visualization
JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.2 No.2, April 27, 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.