Skip to main content
SpringerLink
Log in

Axioms for Regular Words

  • Conference paper
Book cover FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2914))

  • 379 Accesses

Abstract

Courcelle introduced the study of regular words, i.e., words isomorphic to frontiers of regular trees. Heilbrunner showed that a nonempty word is regular iff it can be generated from the singletons by the operations of concatenation, omega power, omega-op power, and the infinite family of shuffle operations. We prove that the nonempty regular words, equipped with these operations, are the free algebras in a variety which is axiomatizable by an infinite collection of some natural equations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bloom, S.L., Choffrut, C.: Long words: the theory of concatenation and ω-power. Theoretical Computer Science 259, 533–548 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bloom, S.L., Ésik, Z.: Deciding whether the frontier of a regular tree is scattered. Fundamenta Informaticae 55, 1–21 (2003)

    MATH  MathSciNet  Google Scholar 

  3. Bloom, S.L., Ésik, Z.: Axiomatizing omega and omega-op powers on words (to appear)

    Google Scholar 

  4. Bloom, S.L., Ésik, Z.: Iteration Theories. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  5. Courcelle, B.: Frontiers of infinite trees. RAIRO Informatique théorique/ Theoretical Computer Science 12, 319–337 (1978)

    MATH  MathSciNet  Google Scholar 

  6. Eilenberg, S., Elgot, C.: Recursiveness. Academic Press, New York (1970)

    MATH  Google Scholar 

  7. Heilbrunner, S.: An algorithm for the solution of fixed-point equations for infinite words. Theoretical Informatics and Applications 14, 131–141 (1980)

    MATH  MathSciNet  Google Scholar 

  8. Rosenstein, J.B.: Linear Orderings. Academic Press, New York (1982)

    MATH  Google Scholar 

  9. Thomas, W.: On frontiers of regular trees. Theoretical Informatics and Applications 20, 371–381 (1986)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Stevens Institute of Technology, Hoboken, NJ, 07030, USA

    Stephen L. Bloom

  2. Institute for Informatics, University of Szeged, Szeged, Hungary

    Zoltán Ésik

Authors
  1. Stephen L. Bloom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zoltán Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tata Institute of Fundamental Research, India

    Paritosh K. Pandya

  2. Tata Institute of Fundamental Research, School of Technology and Computer Science, Mumbai, India

    Jaikumar Radhakrishnan

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bloom, S.L., Ésik, Z. (2003). Axioms for Regular Words. In: Pandya, P.K., Radhakrishnan, J. (eds) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2003. Lecture Notes in Computer Science, vol 2914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24597-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24597-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20680-4

  • Online ISBN: 978-3-540-24597-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation