Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2001: Implementation and Application of Automata pp 52–64Cite as

Brzozowski’s Derivatives Extended to Multiplicities

  • Conference paper
  • First Online:

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

Abstract

Our aim is to study the set of K-rational expressions describing rational series. More precisely we are concerned with the definition of quotients of this set by coarser and coarser congruences which lead to an extension - in the case of multiplicities - of some classical results stated in the Boolean case. In particular, analogues of the well known theorems of Brzozowski and Antimirov are provided in this frame.

Partially supported by the MENRT Scientific Research Program ACI Cryptology.

This is a preview of subscription content, 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

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, Theoretical Computer Science, 155, 291–319 (1996).

    Article  MATH  MathSciNet  Google Scholar 

  2. J. Berstel and D. Perrin Theory of codes, Academic Press (1985).

    Google Scholar 

  3. J. Berstel and C. Reutenauer, Rational Series and Their Languages (EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1988).

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  5. J. H. Conway, Regular Algebras and Finite Machines, Chapman and Hall, London 1974.

    Google Scholar 

  6. K. Culik II and J. Kari, Finite state transformations of images, Proceedings of ICALP 95, Lecture Notes in Comput. Sci. 944 (1995) 51–62.

    Google Scholar 

  7. J.-M. Champarnaud and D. Ziadi, New Finite Automaton Constructions Based on Canonical Derivatives, in CIAA’2000, Lecture Notes in Computer Science, S. Yu ed., Springer-Verlag, to appear.

    Google Scholar 

  8. J.-M. Champarnaud and D. Ziadi, From Mirkin’s Prebases to Antimirov’s Word Partial Derivatives, Fundamenta Informaticae, 45(3), 195–205, 2001.

    MATH  MathSciNet  Google Scholar 

  9. J.-M. Champarnaud and D. Ziadi, Canonical Derivatives, Partial Derivatives, and Finite Automaton Constructions, Theoret. Comp. Sc., to appear.

    Google Scholar 

  10. M. Droste, P. Gastin, On Aperiodic and Star-free Formal Power Series in partially Commuting variables, Proceedings of FPSAC’00, D. Krob, A. A. Mikhalev and A. V. Mikhalev. (Springer, june 2000).

    Google Scholar 

  11. G. Duchamp, D. Krob, Combinatorics on traces, Ch II of the “Book of traces” EATCS monography. (1995) (Ed. G. Rozenberg, V. Dieckert) World Scientific.

    Google Scholar 

  12. G. Duchamp and C. Reutenauer, Un critére de rationalité provenant de la géométrie non-commutative, Invent. Math. 128 (1997) 613–622.

    Article  MATH  MathSciNet  Google Scholar 

  13. G. Duchamp, M. Flouret, É. Laugerotte, J.-G. Luque, Direct and dual laws for automata with multiplicities, Theoret. Comp. Sc., 269/1–2, to appear.

    Google Scholar 

  14. S. Eilenberg, Automata, languages and machines, Vol. A (Acad. Press, New-York, 1974).

    MATH  Google Scholar 

  15. G. Jacob, Représentations et substitutions matricielles dans la théorie algébrique des transductions. Thése d’état. Université Paris VII (1975).

    Google Scholar 

  16. S.C. Kleene, Representation of events in nerve nets and finite automata, Automata Studies, Princeton Univ. Press (1956) 3–42.

    Google Scholar 

  17. D. Krob, Models of a K-rational identity system, Journal of Computer and System Sciences, 45, (3), 396–434, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  18. D. Krob, Differentiation of K-rational expressions identity system, International Journal of Algebra and Computation, 3(1), 15–41, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  19. M. Lothaire, Combinatorics on words (Addison-Wesley, 1983).

    Google Scholar 

  20. S. Mac Lane Categories for the Working Mathematician, Springer (4th ed. 1988).

    Google Scholar 

  21. B. G. Mirkin. An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics, 5:110–116, 1966.

    Google Scholar 

  22. M. Mohri, F. Pereira and M. Riley, A Rational Design for a Weighted Finite-State Transducer Library. Lecture Notes in Computer Science, 1436:43–53, 1998.

    Google Scholar 

  23. C. Reutenauer, A survey on noncommutative rational series, FPSAC’94 proceedings.

    Google Scholar 

  24. A. Salomaa and M. Soittola, Automata-theoretic aspects of formal power series. (Springer-Verlag, 1978).

    Google Scholar 

  25. M. P. Schützenberger, On the definition of a family of automata, Information and Control 4 (1961) 245–270.

    Article  MATH  MathSciNet  Google Scholar 

  26. R. P. Stanley, Enumerative combinatorics, Vol 2, Cambridge (1999).

    Google Scholar 

  27. S. Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume I, Words, Languages, Grammars, pages 41–110. Springer-Verlag, Berlin, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFAR, University of Rouen, France

    Jean-Marc Champarnaud & Gérard Duchamp

Authors
  1. Jean-Marc Champarnaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gérard Duchamp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Pretoria, Lynwood Road, Pretoria, 0002, South Africa

    Bruce W. Watson

  2. Department of Computer Science, Hong Kong University of Science and Technology, Clearwater Bay, Kowloon, Hong Kong

    Derick Wood

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Champarnaud, JM., Duchamp, G. (2002). Brzozowski’s Derivatives Extended to Multiplicities. In: Watson, B.W., Wood, D. (eds) Implementation and Application of Automata. CIAA 2001. Lecture Notes in Computer Science, vol 2494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36390-4_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-36390-4_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-36390-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation