Skip to main content
SpringerLink
Log in

Operations over Automata with Multiplicities

  • Conference paper
  • First Online:
Automata Implementation (WIA 1998)

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

Included in the following conference series:

Abstract

We present here theoretical results coming from the implementation of the package called AMULT (automata with multiplicities in several noncommutative variables). We show that classical formulas are “almost every time” optimal and characterize the dual laws preserving rationality.

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. Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin (1988)

    Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Eilenberg, S.: Automata, languages and machines, Vol. A, Acad. Press, NewYork (1974)

    MATH  Google Scholar 

  5. Fliess, M.: Matrices de Hankel. J. Maths. Pures Appl. 53 (1974) 197–222

    MathSciNet  MATH  Google Scholar 

  6. Fliess, M.: Sur divers produits de séries formelles. Bull. Sc. Math. 102 (1974) 181–191

    MATH  MathSciNet  Google Scholar 

  7. Flouret, M., Laugerotte, E.: Noncommutative minimization algorithms. Inform. Process. Lett. 64 (1997) 123–126

    Article  MathSciNet  Google Scholar 

  8. Harju, T., Karhumäki, J.: The equivalence problem of multitape finite automata. Theoret. Comput. Sci. 78 (1991) 347–355

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  10. Kuich, W., Salomaa, A.: Semirings, automata, languages. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, (1986)

    Google Scholar 

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

    Google Scholar 

  12. Mohri, M., Pereira, F., Riley, M.: A rational design for a weighted finite-state transducer library. Proceedings of WIA’97, (1997) 43–53

    Google Scholar 

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

    Google Scholar 

  14. Schützenberger, M. P.: On the definition of a family of automata. Inform. and Contr. 4 (1961) 245–270

    Article  MATH  Google Scholar 

  15. Schützenberger, M. P.: On a theorem of R. Jungen. Proc. Amer. Soc. 13 (1962) 885–890

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFAR Université de Rouen, Faculté des Sciences et des Techniques, 76821, Mont-Saint-Aignan Cedex, France

    Gérard Duchamp, Marianne Flouret & Éric Laugerotte

Authors
  1. Gérard Duchamp
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marianne Flouret
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Éric Laugerotte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Laboratory, University of Rouen, F-76821, Mont-Saint-Aignan Cedex, France

    Jean-Marc Champarnaud  & Djelloul Ziadi  & 

  2. LI/E3i University of Tours, 64 avenue Jean Portalis, F-37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duchamp, G., Flouret, M., Laugerotte, É. (1999). Operations over Automata with Multiplicities. In: Champarnaud, JM., Ziadi, D., Maurel, D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48057-9_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-48057-9_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66652-3

  • Online ISBN: 978-3-540-48057-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation