Some New Features and Algorithms for the Study of DFA

Avraham N. Trahtman

Research output: Contribution to journalArticlepeer-review

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.
Original languageAmerican English
Pages (from-to)45-50
Number of pages6
JournalOpen Journal of Discrete Mathematics
Volume2
Issue number2
DOIs
StatePublished - 1 Apr 2012

Fingerprint

Dive into the research topics of 'Some New Features and Algorithms for the Study of DFA'. Together they form a unique fingerprint.

Cite this