Skip to main content
SpringerLink
Log in
SpringerLink
Log in

SEA: A Symbolic Environment for Automata Theory

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

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

Included in the following conference series:

Abstract

We here present the system SEA which integrates manipulations over boolean and multiplicity automata. The system provides also self development facilities.

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. J. Berstel and D. Perrin, Theory of codes, Academic Press, 1985.

    Google Scholar 

  2. J. Berstel and C. Reutenauer, Rational series and their languages, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1988.

    Google Scholar 

  3. P. Caron, AG: A set of Maple packages for manipulating automata and finite semigroups. Software-Practice & Experience, 27(8), 863–884, 1997.

    Google Scholar 

  4. J.-M. Champarnaud and G. Hansel, Automate, a computing package for automata and finite semigroups, J. Symbolic Comput., 12, 197–220, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  5. G. Duchamp, M. Flouret and E. Laugerotte, Operations over automata with multiplicities, WIA 98, to appear in Lect. Notes in Comp. Sci.

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. M. Flouret, Contribution à lálgorithmique non commutative, Ph.D. thesis, University of Rouen, 1999.

    Google Scholar 

  9. J. E. Hopcroft, An n log n algorithm for minimizing the states in a finite automaton, In Z. Kohavi, editor, The theory of machines and computations, pages 189–196. Academic Press, New York, 1971.

    Google Scholar 

  10. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.

    Google Scholar 

  11. S. C. Kleene, Representation of events in nerve nets and finite automata, Automata studies, 1956.

    Google Scholar 

  12. M. Lothaire, Combinatorics on words, Addison-Wesley, 1983.

    Google Scholar 

  13. O. Matz, A. Miller, A. Potthoff, W. Thomas, and E. Valkena, Report on the program AMoRE, Report, Institut fur informatik und praktische mathematik, Christian-Albrechts Universitat, Kiel, 1995.

    Google Scholar 

  14. E. F. Moore, Gedanken experiments on sequential machines, In Automata studies, pages 129–153, Princeton Univ. Press, Princeton, N.J., 1956.

    Google Scholar 

  15. A. Nerode, Linear automata transformation In Proceedings of AMS 9, pages 541–544, 1958.

    Google Scholar 

  16. D. Raymond and D. Wood, Grail, a C++ library for automata and expressions, J. Symbolic Comput., 17, 341–350, 1994.

    Article  Google Scholar 

  17. M. P. Schutzenberger, On the definition of a family of automata, Inform. and Control, 4,245–270, 1961.

    Article  MathSciNet  Google Scholar 

  18. M. P. Schutzenberger, On a theorem of R. Jungen, Proc. Amer. Soc., 13, 885–890, 1962.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFAR, Université de Rouen, 76134, Mont-Saint-Aignan Cedex, France

    Philippe Andary, Pascal Caron, Jean-Marc Champarnaud, Gérard Duchamp, Marianne Flouret & Éric Laugerotte

Authors
  1. Philippe Andary
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pascal Caron
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean-Marc Champarnaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gérard Duchamp
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Marianne Flouret
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Éric Laugerotte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Potsdam, Institut für Informatik, August-Bebel-Straße 89, 14482, Potsdam, Germany

    Oliver Boldt

  2. Institut für Informatik, Universität Potsdam, Potsdam

    Helmut Jürgensen

  3. Department of Computer Science, The University of Western Ontario, London, Ontario, Canada, N6A 5B7

    Helmut Jürgensen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andary, P., Caron, P., Champarnaud, JM., Duchamp, G., Flouret, M., Laugerotte, É. (2001). SEA: A Symbolic Environment for Automata Theory. In: Boldt, O., Jürgensen, H. (eds) Automata Implementation. WIA 1999. Lecture Notes in Computer Science, vol 2214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45526-4_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45526-4_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42812-1

  • Online ISBN: 978-3-540-45526-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation