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 publicationAlgebra and Coalgebra in Computer Science - Second International Conference, CALCO 2007, Proceedings
PublisherSpringer Verlag
Pages1-15
Number of pages15
ISBN (Print)9783540738572
DOIs
Publication statusPublished - Jan 1 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)0302-9743
ISSN (Electronic)1611-3349

Other

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Regular and algebraic words and ordinals'. Together they form a unique fingerprint.

  • Cite this

    Bloom, S. L., & Ésik, Z. (2007). Regular and algebraic words and ordinals. In Algebra and Coalgebra in Computer Science - Second International Conference, CALCO 2007, Proceedings (pp. 1-15). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4624 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-73859-6_1