AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
From MaRDI portal
Publication:4285342
Recommendations
Cited in
(39)- Regular and Algebraic Words and Ordinals
- Complementation of Branching Automata for Scattered and Countable N-Free Posets
- Regular tree languages in low levels of the Wadge hierarchy
- Algebra for Infinite Forests with an Application to the Temporal Logic EF
- Equational Theories of Scattered and Countable Series-Parallel Posets
- Mathematical Foundations of Computer Science 2004
- Wreath product and infinite words
- First-order separation over countable ordinals
- An algebraic approach to MSO-definability on countable linear orderings
- A representation theorem of infinite dimensional algebras and applications to language theory
- The Wadge-Wagner hierarchy of ω-rational sets
- A Reiterman theorem for pseudovarieties of finite first-order structures
- Classes of regular and context-free languages over countably infinite alphabets
- Regular languages of thin trees
- On labeled birooted tree languages: algebras, automata and logic
- Long words: The theory of concatenation and \(\omega\)-power
- Complexity of Topological Properties of Regular ω-Languages
- The logical strength of Büchi's decidability theorem
- Model-theoretic properties of \(\omega\)-automatic structures
- A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
- Varieties
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- The equational theory of regular words
- scientific article; zbMATH DE number 176766 (Why is no real title available?)
- Logic, semigroups and automata on words
- scientific article; zbMATH DE number 7649888 (Why is no real title available?)
- A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
- scientific article; zbMATH DE number 7438576 (Why is no real title available?)
- A negative answer to a question of Wilke on varieties of \(\omega\)-languages
- Reducing the time complexity of testing for local threshold testability
- Finite semigroups with infinite product and languages of infinite words.
- Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
- Characterizing classes of regular languages using prefix codes of bounded synchronization delay
- Axiomatizing omega and omega-op powers of words
- Two equational theories of partial words
- Embedding finite and infinite words into overlapping tiles (short paper)
- Boolean algebras of regular languages
- Algebraic and graph-theoretic properties of infiniten-posets
- On syntactic congruences for \(\omega\)-languages
This page was built for publication: AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285342)
