scientific article
From MaRDI portal
Publication:4036596
zbMath0766.68083MaRDI QIDQ4036596
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Applications of universal algebra in computer science (08A70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (31)
Recognisable Languages over Monads ⋮ *-Continuous Kleene $$\omega $$-Algebras ⋮ Factorization forests for infinite words and applications to countable scattered linear orderings ⋮ Unnamed Item ⋮ On Completeness of Omega-Regular Algebras ⋮ A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I ⋮ A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II ⋮ The Wadge-Wagner hierarchy of ω-rational sets ⋮ On syntactic congruences for \(\omega\)-languages ⋮ The Algebraic Counterpart of the Wagner Hierarchy ⋮ Schützenberger and Eilenberg theorems for words on linear orderings ⋮ Unnamed Item ⋮ Algebras for classifying regular tree languages and an application to frontier testability ⋮ On language varieties without Boolean operations ⋮ Fragments of first-order logic over infinite words ⋮ Long words: The theory of concatenation and \(\omega\)-power ⋮ Eilenberg Theorems for Free ⋮ Complementation of Branching Automata for Scattered and Countable N-Free Posets ⋮ Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings ⋮ Quantifier Alternation for Infinite Words ⋮ Profinite Monads, Profinite Equations, and Reiterman’s Theorem ⋮ Logic, semigroups and automata on words ⋮ Unnamed Item ⋮ Wadge-Wagner hierarchies ⋮ Wreath product and infinite words ⋮ How to decide continuity of rational functions on infinite words ⋮ Star-free sets of words on ordinals ⋮ Completeness results for omega-regular algebras ⋮ Unnamed Item ⋮ Logic over words on denumerable ordinals ⋮ Axiomatizing the subsumption and subword preorders on finite and infinite partial words
This page was built for publication:
