scientific article; zbMATH DE number 176766
From MaRDI portal
Publication:4036596
zbMATH Open0766.68083MaRDI QIDQ4036596FDOQ4036596
Authors: Thomas Wilke 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
Formal languages and automata (68Q45) Applications of universal algebra in computer science (08A70) Semigroups in automata theory, linguistics, etc. (20M35)
Cited In (39)
- Algebras for classifying regular tree languages and an application to frontier testability
- Fragments of first-order logic over infinite words
- Title not available (Why is that?)
- On completeness of omega-regular algebras
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
- Profinite monads, profinite equations, and Reiterman's theorem
- Factorization forests for infinite words and applications to countable scattered linear orderings
- Title not available (Why is that?)
- A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II
- On language varieties without Boolean operations
- Typed monoids -- an Eilenberg-like theorem for non regular languages
- \(^*\)-continuous Kleene \(\omega \)-algebras
- Families of DFAs as acceptors of \(\omega\)-regular languages
- Recognisable languages over monads
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- Schützenberger and Eilenberg theorems for words on linear orderings
- The Algebraic Counterpart of the Wagner Hierarchy
- Logic over words on denumerable ordinals
- A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I
- Star-free sets of words on ordinals
- A categorical approach to syntactic monoids
- Title not available (Why is that?)
- Long words: The theory of concatenation and \(\omega\)-power
- A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
- Logic, semigroups and automata on words
- Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
- Developments in Language Theory
- On syntactic congruences for \(\omega\)-languages
- Eilenberg Theorems for Free
- Model theoretic results for infinitely deep languages
- Completeness results for omega-regular algebras
- Wadge-Wagner hierarchies
- Einfache Beweise Für Die Eindeutige Zerlegbarkeit Von Ausdrücken Endlicher und Unendlicher Sprachen
- The Wadge-Wagner hierarchy of ω-rational sets
- Quantifier alternation for infinite words
- Complementation of Branching Automata for Scattered and Countable N-Free Posets
- How to decide continuity of rational functions on infinite words
- Wreath product and infinite words
- On Rough Approximations of Languages under Infinite Index Indiscernibility Relations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036596)
