Epichristoffel Words and Minimization of Moore Automata

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

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

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On extremal cases of Hopcroft's algorithm 👍 👎
• Implementation and Application of Automata 👍 👎
• Minimisation of acyclic deterministic automata in linear time 👍 👎
• Words, Trees and Automata Minimization 👍 👎
• Standard Sturmian words and automata minimization algorithms 👍 👎
• On Extremal Cases of Hopcroft’s Algorithm 👍 👎
• Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality 👍 👎
• Minimisation of automata 👍 👎

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)