AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
From MaRDI portal
Publication:4285342
DOI10.1142/S0218196793000287zbMATH Open0791.68116MaRDI QIDQ4285342FDOQ4285342
Publication date: 24 March 1994
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Recommendations
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Applications of universal algebra in computer science (08A70) Semigroups in automata theory, linguistics, etc. (20M35)
Cited In (35)
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- A Reiterman theorem for pseudovarieties of finite first-order structures
- Title not available (Why is that?)
- Algebraic and graph-theoretic properties of infiniten-posets
- Mathematical Foundations of Computer Science 2004
- Reducing the time complexity of testing for local threshold testability
- Regular and Algebraic Words and Ordinals
- Title not available (Why is that?)
- Regular languages of thin trees
- A representation theorem of infinite dimensional algebras and applications to language theory
- Varieties
- Two equational theories of partial words
- Title not available (Why is that?)
- Axiomatizing omega and omega-op powers of words
- First-order separation over countable ordinals
- Model-theoretic properties of \(\omega\)-automatic structures
- Complexity of Topological Properties of Regular ω-Languages
- A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
- Characterizing classes of regular languages using prefix codes of bounded synchronization delay
- Title not available (Why is that?)
- Long words: The theory of concatenation and \(\omega\)-power
- Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
- Logic, semigroups and automata on words
- On syntactic congruences for \(\omega\)-languages
- A negative answer to a question of Wilke on varieties of \(\omega\)-languages
- On labeled birooted tree languages: algebras, automata and logic
- The Wadge-Wagner hierarchy of ω-rational sets
- Classes of regular and context-free languages over countably infinite alphabets
- The equational theory of regular words
- AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS
- Complementation of Branching Automata for Scattered and Countable N-Free Posets
- Title not available (Why is that?)
- Equational Theories of Scattered and Countable Series-Parallel Posets
- Algebra for Infinite Forests with an Application to the Temporal Logic EF
- Wreath product and infinite words
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)
