scientific article; zbMATH DE number 176766
From MaRDI portal
Publication:4036596
Recommendations
Cited in
(40)- Model theoretic results for infinitely deep languages
- On syntactic congruences for \(\omega\)-languages
- Wreath product and infinite words
- How to decide continuity of rational functions on infinite words
- Logic over words on denumerable ordinals
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- Logic, semigroups and automata on words
- Star-free sets of words on ordinals
- Wadge-Wagner hierarchies
- On language varieties without Boolean operations
- Completeness results for omega-regular algebras
- Quantifier alternation for infinite words
- Profinite monads, profinite equations, and Reiterman's theorem
- On completeness of omega-regular algebras
- Typed monoids -- an Eilenberg-like theorem for non regular languages
- Recognisable languages over monads
- ^*-continuous Kleene -algebras
- The Algebraic Counterpart of the Wagner Hierarchy
- Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
- scientific article; zbMATH DE number 3909765 (Why is no real title available?)
- scientific article; zbMATH DE number 4028927 (Why is no real title available?)
- Einfache Beweise Für Die Eindeutige Zerlegbarkeit Von Ausdrücken Endlicher und Unendlicher Sprachen
- Schützenberger and Eilenberg theorems for words on linear orderings
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
- The Wadge-Wagner hierarchy of ω-rational sets
- Families of DFAs as acceptors of -regular languages
- Algebras for classifying regular tree languages and an application to frontier testability
- A categorical approach to syntactic monoids
- Complementation of Branching Automata for Scattered and Countable N-Free Posets
- Eilenberg Theorems for Free
- On Rough Approximations of Languages under Infinite Index Indiscernibility Relations
- A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
- 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
- Fragments of first-order logic over infinite words
- Developments in Language Theory
- From equational specifications of algebras with structure to varieties of data languages (invited paper)
- Long words: The theory of concatenation and -power
- A robust measure on FDFAs following duo-normalized acceptance
- Factorization forests for infinite words and applications to countable scattered linear orderings
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)
