Automata and semigroups recognizing infinite words

zbMATH Open1217.68143MaRDI QIDQ3086922FDOQ3086922

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

Publication date: 30 March 2011

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

zbMATH Keywords

algebraic approachsurvey articleMuller automata\(\omega\)-semigroupsautomata accepting infinite wordsBüchi automata

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(X\)-automata on \(\omega\)-words
• Title not available (Why is that?)
• Synthesis of computable regular functions of infinite words
• Classifying recognizable infinitary trace languages using word automata

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)