Surminimisation of automata

DOI10.1007/978-3-319-21500-6_28MaRDI QIDQ3451115zbMATH OpenOpenAlexFDO

Authors Victor Marsault

Publication date 10 November 2015

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-21500-6_28

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Minimizing subsequential transducers: a survey.
• Hyper-minimisation Made Efficient
• Words, trees and automata minimization
• Hyper-minimizing minimized deterministic finite state automata
• On the minimization problem for \(\omega \)-automata

Cites work

• Abstract numeration systems
• Analyticity of the Schrödinger Scattering Amplitude and Nonrelativistic Dispersion Relations
• Digital sum problems and substitutions on a finite alphabet
• scientific article; zbMATH DE number 5643878 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 1916667 (Why is no real title available?)
• Number representation and finite automata
• Numeration systems on a regular language
• Odometers on regular languages
• Rational base number systems for p-adic numbers

Cited in

(2)

• Linear recurrence sequence automata and the addition of abstract numeration systems
• The signature of rational languages

This page was built for publication: Surminimisation of automata

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