scientific article
From MaRDI portal
Publication:3123633
zbMath0877.20045MaRDI QIDQ3123633
Jean-Eric Pin, Dominique Perrin
Publication date: 7 December 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Büchi automatasyntactic congruencesrecognizable setsMuller automata\(\omega\)-semigroups\(\omega\)-rational setsalgebraic theory of infinite wordsWilke algebras
Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
On omega context free languages which are Borel sets of infinite rank. ⋮ Towards a language theory for infinite N-free pomsets. ⋮ Factorization forests for infinite words and applications to countable scattered linear orderings ⋮ The monadic theory of finite representations of infinite words ⋮ A negative answer to a question of Wilke on varieties of \(\omega\)-languages ⋮ A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I ⋮ The Wadge-Wagner hierarchy of ω-rational sets ⋮ Borel hierarchy and omega context free languages. ⋮ The Algebraic Counterpart of the Wagner Hierarchy ⋮ Unambiguous Büchi automata. ⋮ Coinductive Algorithms for Büchi Automata ⋮ Model-theoretic properties of \(\omega\)-automatic structures ⋮ Long words: The theory of concatenation and \(\omega\)-power ⋮ Algebraic and graph-theoretic properties of infiniten-posets ⋮ Wreath product and infinite words ⋮ A logical characterization of data languages. ⋮ On labeled birooted tree languages: algebras, automata and logic
