Skip to main content

Derivation of Rational Expressions with Multiplicity

  • Conference paper
  • First Online:

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

Abstract

This paper introduces a generalization of the partial derivatives of rational expressions, due to Antimirov, to rational expressions with multiplicity. We define the derivation of a rational expression with multiplicity in such a way that the result is a polynomial of expressions. This amounts to interpreting the addition symbol at the upper level in the semiring of coefficients.

Former results of Brzozowski and of Antimirov are then expressed in that framework that allows to deal with rational power series, and automata and expressions with multiplicity as well.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Antimirov, Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155 (1996), 291–319.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. Berstel AND Ch. Reutenauer, Les séries rationnelles et leurs langages. Masson, 1984. Translation: Rational Series and their Languages. Springer, 1986.

    Google Scholar 

  3. J. A. Brzozowski, Derivatives of regular expressions. J. Assoc. Comput. Mach. 11 (1964), 481–494.

    MATH  MathSciNet  Google Scholar 

  4. P. Caron AND M. Flouret, Glushkov construction for multiplicities. Pre-Proceedings of CIAA’00, M. Daley, M. Eramian and S. Yu, eds, Univ. of Western Ontario, (2000), 52–61.

    Google Scholar 

  5. J.-M. Champarnaud AND D. Ziadi, New finite automaton constructions based on canonical derivatives. Pre-Proceedings of CIAA’00, M. Daley, M. Eramian and S. Yu, eds, Univ. of Western Ontario, (2000), 36–43.

    Google Scholar 

  6. S. Eilenberg, Automata, Languages and Machines, volume A. Academic Press, 1974.

    Google Scholar 

  7. V. Glushkov, The abstract theory of automata. Russian Mathematical Surveys 16 (1961), 1–53.

    Article  Google Scholar 

  8. W. Kuich, AND A. Salomaa, Semirings, Automata, Languages. Springer, 1986.

    Google Scholar 

  9. S. Lombardy, Approche structurelle de quelques problèmes de la théorie des automates. Thèse Doc. ENST, 2001.

    Google Scholar 

  10. R. McNaughton, AND H. Yamada, Regular expressions and state graphs for automata. IRE Trans. on electronic computers 9 (1960), 39–47.

    Article  Google Scholar 

  11. J. Rutten, Automata, power series, and coinduction: taking input derivatives seriously. Proceedings ICALP’99 (J. Wiedermann, P. van Emde Boas and M. Nielsen, Eds) Lecture Notes in Comput. Sci. 1644 (1999), 645–654.

    Google Scholar 

  12. J. Sakarovitch, Eléments de théorie des automates. Vuibert, 2002, to appear. Eng. trans. Cambridge University Press, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lombardy, S., Sakarovitch, J. (2002). Derivation of Rational Expressions with Multiplicity. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-45687-2_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44040-6

  • Online ISBN: 978-3-540-45687-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics