Regular and algebraic words and ordinals

S. L. Bloom, Z. Ésik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages1-15
Number of pages15
Volume4624 LNCS
Publication statusPublished - 2007
Event2nd International Conference on Algebra and Coalgebra in Computer Science, CALCO 2007 - Bergen, Norway
Duration: Aug 20 2007Aug 24 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4624 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other2nd International Conference on Algebra and Coalgebra in Computer Science, CALCO 2007
CountryNorway
CityBergen
Period8/20/078/24/07

Fingerprint

Ordinals
Fixed-point Equation
Infinite Words
Two Parameters

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Bloom, S. L., & Ésik, Z. (2007). Regular and algebraic words and ordinals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4624 LNCS, pp. 1-15). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4624 LNCS).

Regular and algebraic words and ordinals. / Bloom, S. L.; Ésik, Z.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4624 LNCS 2007. p. 1-15 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4624 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bloom, SL & Ésik, Z 2007, Regular and algebraic words and ordinals. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4624 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4624 LNCS, pp. 1-15, 2nd International Conference on Algebra and Coalgebra in Computer Science, CALCO 2007, Bergen, Norway, 8/20/07.
Bloom SL, Ésik Z. Regular and algebraic words and ordinals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4624 LNCS. 2007. p. 1-15. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bloom, S. L. ; Ésik, Z. / Regular and algebraic words and ordinals. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4624 LNCS 2007. pp. 1-15 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{601e05bd72ef47dfb87da94d7af25ad6,
title = "Regular and algebraic words and ordinals",
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.",
author = "Bloom, {S. L.} and Z. {\'E}sik",
year = "2007",
language = "English",
isbn = "9783540738572",
volume = "4624 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "1--15",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Regular and algebraic words and ordinals

AU - Bloom, S. L.

AU - Ésik, Z.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38049054878&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38049054878&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38049054878

SN - 9783540738572

VL - 4624 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 15

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -