Words, trees and automata minimization

DOI10.1007/978-3-642-40579-2_6zbMATH Open1398.68410OpenAlexW153988263MaRDI QIDQ2849974FDOQ2849974

Authors: M. Sciortino, G. Castiglione 

Publication date: 20 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40579-2_6

Recommendations

• Standard Sturmian words and automata minimization algorithms
• Hopcroft's automaton minimization algorithm and Sturmian words
• On Extremal Cases of Hopcroft’s Algorithm
• On extremal cases of Hopcroft's algorithm
• Epichristoffel Words and Minimization of Moore Automata

Mathematics Subject Classification ID

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

Cited In (7)

• Words of minimum rank in deterministic finite automata
• Epichristoffel Words and Minimization of Moore Automata
• Hopcroft's automaton minimization algorithm and Sturmian words
• Surminimisation of automata
• Standard Sturmian words and automata minimization algorithms
• Title not available (Why is that?)
• Minimization of Word-Level Decision Diagrams

This page was built for publication: Words, trees and automata minimization

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