AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
From MaRDI portal
Publication:4285342
DOI10.1142/S0218196793000287zbMath0791.68116MaRDI QIDQ4285342
Publication date: 24 March 1994
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Formal languages and automata (68Q45) Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (26)
Equational Theories of Scattered and Countable Series-Parallel Posets ⋮ Regular languages of thin trees ⋮ A negative answer to a question of Wilke on varieties of \(\omega\)-languages ⋮ Two equational theories of partial words ⋮ Algebra for Infinite Forests with an Application to the Temporal Logic EF ⋮ Axiomatizing omega and omega-op powers of words ⋮ The Wadge-Wagner hierarchy of ω-rational sets ⋮ Unnamed Item ⋮ A Reiterman theorem for pseudovarieties of finite first-order structures ⋮ On syntactic congruences for \(\omega\)-languages ⋮ Characterizing classes of regular languages using prefix codes of bounded synchronization delay ⋮ Unnamed Item ⋮ First-order separation over countable ordinals ⋮ Complexity of Topological Properties of Regular ω-Languages ⋮ Model-theoretic properties of \(\omega\)-automatic structures ⋮ Reducing the time complexity of testing for local threshold testability ⋮ Long words: The theory of concatenation and \(\omega\)-power ⋮ Algebraic and graph-theoretic properties of infiniten-posets ⋮ Complementation of Branching Automata for Scattered and Countable N-Free Posets ⋮ AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS ⋮ Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets ⋮ Unnamed Item ⋮ Logic, semigroups and automata on words ⋮ Varieties ⋮ Wreath product and infinite words ⋮ On labeled birooted tree languages: algebras, automata and logic
This page was built for publication: AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
