The equational theory of regular words

DOI10.1016/j.ic.2005.01.004zbMath1083.68072MaRDI 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

decidability; variety; equational theory; axiomatization; free generation; algebra of regular words

Mathematics Subject Classification ID

08A70: Applications of universal algebra in computer science

68Q70: Algebraic theory of languages and automata

03B25: Decidability of theories and sets of sentences

03C05: Equational classes, universal algebra in model theory

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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