The equational theory of regular words

DOI10.1016/j.ic.2005.01.004zbMath1083.68072OpenAlexW1991735660MaRDI QIDQ1776401

Zoltán Ésik, Stephen L. Bloom

Publication date: 12 May 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2005.01.004

zbMATH Keywords

decidabilityvarietyequational theoryaxiomatizationfree generationalgebra of regular words

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25) Equational classes, universal algebra in model theory (03C05)

Related Items

ORDINAL AUTOMATA AND CANTOR NORMAL FORM ⋮ Büchi context-free languages ⋮ An undecidable property of context-free linear orders ⋮ Unnamed Item ⋮ Closures in Binary Partial Algebras ⋮ The Order Type of Scattered Context-Free Orderings of Rank One Is Computable ⋮ Isomorphism of Regular Trees and Words ⋮ Pro-aperiodic monoids via saturated models ⋮ ALGEBRAIC LINEAR ORDERINGS ⋮ ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS ⋮ The ordinal generated by an ordinal grammar is computable ⋮ A Mezei-Wright theorem for categorical algebras ⋮ Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\)

Cites Work

• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• Automata, logics, and infinite games. A guide to current research
• Matrix and matricial iteration theories. I
• On frontiers of regular trees
• Axiomatizing omega and omega-op powers of words
• Mathematical Foundations of Computer Science 2003
• Long words: The theory of concatenation and \(\omega\)-power
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item