Axiomatizing omega and omega-op powers of words

DOI10.1051/ita:2004005zbMath1082.68070OpenAlexW2123159937MaRDI QIDQ4825384

Stephen L. Bloom, Zoltán Ésik

Publication date: 28 October 2004

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2004__38_1_3_0

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 (4)

Equational Theories of Scattered and Countable Series-Parallel Posets ⋮ Büchi context-free languages ⋮ The equational theory of regular words ⋮ ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS

Cites Work

• Equational properties of iteration in algebraically complete categories
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• Finite automata and ordinals
• On frontiers of regular trees
• AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
• Long words: The theory of concatenation and \(\omega\)-power
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Axiomatizing omega and omega-op powers of words