Regular and algebraic words and ordinals

Authors:
S. L. Bloom;Z. Ésik
Affiliations:
Dept. of Computer Science, Stevens Institute of Technology, Hoboken, NJ;Dept. of Computer Science, University of Szeged, Szeged, Hungary and GRLMC, Rovira i Virgili University, Tarragona, Spain
Venue:
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Year:
2007

Citing 8
Cited 9

The equational logic of fixed points

Theoretical Computer Science
Equational properties of iteration in algebraically complete categories

MFCS '96 Selected papers from the 21st symposium on Mathematical foundations of computer science
Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
Long words: the theory of concatenation and &ohgr;-power

Theoretical Computer Science
Varieties Of Formal Languages

Varieties Of Formal Languages
Deciding whether the frontier of a regular tree is scattered

Fundamenta Informaticae
Automata on linear orderings

Journal of Computer and System Sciences
The equational theory of regular words

Information and Computation

Context-Free Languages of Countable Words

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
A Mezei-Wright theorem for categorical algebras

Theoretical Computer Science
Algebraic Ordinals

Fundamenta Informaticae
Linear orders in the pushdown hierarchy

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
An undecidable property of context-free linear orders

Information Processing Letters
Scattered context-free linear orderings

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Hausdorff rank of scattered context-free linear orders

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
On context-free languages of scattered words

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
A context-free linear ordering with an undecidable first-order theory

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We solve fixed point equations over finite and infinite words by initiality. By considering equations without and with parameters, two families of words arise, the regular and the algebraic words. Regular words were introduced by Courcelle in the late 1970's. We provide a summary of results on regular words, some of which have been obtained very recently, and include some new results for algebraic words.