Skip to main content
SpringerLink
Log in

Regular and Algebraic Words and Ordinals

  • Conference paper
Algebra and Coalgebra in Computer Science (CALCO 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4624))

Included in the following conference series:

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.

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. Goguen, J., Thatcher, J., Wagner, E., Wright, J.: Initial algebra semantics and continuous algebras. J. ACM 24, 68–95 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bès, A., Carton, O.: A Kleene theorem for languages of words indexed by linear orderings. Int. J. Foundations Computer Science 17, 519–542 (2006)

    Article  MATH  Google Scholar 

  3. Bloom, S.L.: Varieties of ordered algebras. J. Computers and Sys. Sci. 45, 200–212 (1976)

    MathSciNet  Google Scholar 

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

  5. Bloom, S.L., Elgot, C.C., Wright, J.B.: Solutions of the iteration equation and extensions of the scalar iteration operation. Siam J. Computing 9, 26–45 (1980)

    Google Scholar 

  6. Bloom, S.L., Elgot, C.C., Wright, J.B.: Vector iteration in pointed iterative theories. Siam J. Computing 9, 525–540 (1980)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  8. Bloom, S.L., Ésik, Z.: The equational logic of fixed points. Theoretical Computer Science 179, 1–2 (1997)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  10. Bloom, S.L., Ésik, Z.: Axiomatizing omega and omega-op powers on words. Theoretical Informatics and Applications 38, 3–17 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Bloom, S.L., Ésik, Z.: The equational theory of regular words. Information and Computation 197(1-2), 55–89 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  12. Bruyère, V., Carton, O.: Automata on linear orderings. J. Computer System Sciences 73, 1–24 (2007)

    Article  MATH  Google Scholar 

  13. Bc̈hi, J.R.: Transfinite automata recursions and weak second order theory of ordinals. In: Logic, Methodology and Philosophy of Science Proc. 1964 Internatational Congress North-Holland, Amsterdam, pp. 3–23 (1965)

    Google Scholar 

  14. Courcelle, B.: A representation of trees by languages, 1 and II, Theoretical Computer Science, 6, 155-279, 7, 25–55 (1978)

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  16. Elgot, C.: Monadic computation and iterative algebraic theories. In: Shepherdson, J.C. (ed.) Logic Colloquium 1973, Studies in Logic, vol. 80, North Holland, Amsterdam (1975)

    Google Scholar 

  17. Ésik, Z.: Identities in Iterative and rational theories. Computational Linguistics and Computer Languages 14, 183–207 (1980)

    MATH  MathSciNet  Google Scholar 

  18. Ésik, Z., Labella, A.: Equational properties of iteration in algebraically complete categories. In: Selected papers from the 21st symposium on Mathematical foundations of computer science MFCS 1996. Theoretical Computer Science, vol. 195, pp. 61–89 (1998)

    Google Scholar 

  19. Grätzer, G.: Universal Algebra, 2nd edn. Springer, Heidelberg (1979)

    MATH  Google Scholar 

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

  21. Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Information and Control 11, 3–29 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  22. Nivat, M.: On the interpretation of recursive polyadic program schemes. Symposia Mathematica 15, 255–281 (1975)

    MathSciNet  Google Scholar 

  23. Pin, J.-E.: Varieties of Formal Languages. Plenum Publishing Corp. New York (1986)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  25. Scott, D.: Data types as lattices. SIAM J. Computing 5, 522–587 (1976)

    Article  MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    S. L. Bloom

  2. Dept. of Computer Science, University of Szeged, Szeged, Hungary, GRLMC, Rovira i Virgili University, Tarragona, Spain

    Z. Ésik

Authors
  1. S. L. Bloom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Z. Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Till Mossakowski Ugo Montanari Magne Haveraaen

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bloom, S.L., Ésik, Z. (2007). Regular and Algebraic Words and Ordinals. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds) Algebra and Coalgebra in Computer Science. CALCO 2007. Lecture Notes in Computer Science, vol 4624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73859-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73859-6_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73857-2

  • Online ISBN: 978-3-540-73859-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation