Automata and semigroups recognizing infinite words

MaRDI QIDQ3086922zbMATH OpenFDO

Authors Olivier Carton, Dominique Perrin, Jean-Éric Pin

Publication date 30 March 2011

zbMATH Keywords

\(\omega\)-semigroupsalgebraic approachautomata accepting infinite wordsBüchi automataMuller automatasurvey article

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 988807
• scientific article; zbMATH DE number 3976377
• scientific article; zbMATH DE number 3972187
• Automata on infinite objects and their applications to logic and programming
• Generalized automata on infinite trees and Muller-McNaughton's theorem

Cited in

(10)

• \(X\)-automata on \(\omega\)-words
• Classifying recognizable infinitary trace languages using word automata
• scientific article; zbMATH DE number 988807 (Why is no real title available?)
• scientific article; zbMATH DE number 3976377 (Why is no real title available?)
• Automata, Semigroups and Recognizability of Words on Ordinals
• scientific article; zbMATH DE number 7559499 (Why is no real title available?)
• On canonical models for rational functions over infinite words
• Synthesis of computable regular functions of infinite words
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• A robust measure on FDFAs following duo-normalized acceptance

This page was built for publication: Automata and semigroups recognizing infinite words

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