Epichristoffel Words and Minimization of Moore Automata

DOI10.3233/FI-2014-1104zbMATH Open1326.68212MaRDI QIDQ5259268FDOQ5259268

Authors M. Sciortino, G. Castiglione

Publication date 26 June 2015

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

Moore automatareduction treeepi-Christoffel wordsfactorization of words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Words, trees and automata minimization
• Standard Sturmian words and automata minimization algorithms
• On Extremal Cases of Hopcroft’s Algorithm
• Minimisation of acyclic deterministic automata in linear time
• On extremal cases of Hopcroft's algorithm
• Building the minimal automaton of \(A ^{*} X\) in linear time, when \(X\) is of bounded cardinality
• Hopcroft's automaton minimization algorithm and Sturmian words
• Implementation and Application of Automata
• Minimisation of automata
• scientific article; zbMATH DE number 4166871

Cited in

(1)

• Words, trees and automata minimization

This page was built for publication: Epichristoffel Words and Minimization of Moore Automata

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