scientific article
From MaRDI portal
Publication:3728249
zbMath0596.20059MaRDI QIDQ3728249
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
rationalityinfinite wordsrecognizabilitydeterministic automatavarieties of finite semigroupsjoins of languageslanguage recognizable by a varietypiecewise testable semigroups
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (8)
A negative answer to a question of Wilke on varieties of \(\omega\)-languages ⋮ Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words) ⋮ Schützenberger and Eilenberg theorems for words on linear orderings ⋮ The complexity of weakly recognizing morphisms ⋮ On the complementation of Büchi automata ⋮ Wreath product and infinite words ⋮ Star-free sets of words on ordinals ⋮ Logic over words on denumerable ordinals
This page was built for publication: