Some New Features and Algorithms for the Study of DFA

DOI10.4236/OJDM.2012.22008MaRDI QIDQ5350465zbMATH OpenOpenAlexFDO

Authors A. N. Trahtman

Publication date 1 September 2017

Published in Open Journal of Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2011.05575

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Formal languages and automata (68Q45)

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.

Recommendations

• A new algorithm for the construction of minimal acyclic DFAs.
• A multivariate analysis of some DFA problems
• scientific article; zbMATH DE number 1941938
• Description and analysis of a bottom-up DFA minimization algorithm
• New results on deterministic sgraffito automata
• Efficient algorithms for the inference of minimum size DFAs
• New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
• Weak minimization of DFA -- an algorithm and applications
• Weak Minimization of DFA — An Algorithm and Applications
• scientific article; zbMATH DE number 1689049

Cited in

(2)

• COMPAS -- a computing package for synchronization
• Groups synchronizing a transformation of non-uniform kernel

This page was built for publication: Some New Features and Algorithms for the Study of DFA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5350465)