Regular and Algebraic Words and Ordinals

DOI10.1007/978-3-540-73859-6_1MaRDI QIDQ3612480zbMATH OpenOpenAlexFDO

Authors Stephen L. Bloom, Zoltán Ésik

Publication date 10 March 2009

Published in Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73859-6_1

Mathematics Subject Classification ID

Theories (e.g., algebraic theories), structure, and semantics (18C10) Algebraic theory of languages and automata (68Q70)

Recommendations

• The equational theory of regular words
• TRANSFINITE EQUATIONS IN TRANSFINITE STRINGS
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Long words: The theory of concatenation and -power
• AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS

Cited in

(7)

• A Mezei-Wright theorem for categorical algebras
• An undecidable property of context-free linear orders
• The ordinal generated by an ordinal grammar is computable
• Matrix and matricial iteration theories. I
• Matrix and matricial iteration theories. II
• TRANSFINITE EQUATIONS IN TRANSFINITE STRINGS
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Regular and Algebraic Words and Ordinals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612480)