Skip to main content
SpringerLink
Log in

Introducing Vaucanson

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2003)

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

Included in the following conference series:

Abstract

This paper reports on a new software platform called Vaucanson and dedicated to the computation with automata and transducers. Its main feature is the capacity of dealing with automata whose labels may belong to various algebraic structures.

The paper successively shows how Vaucanson allows to program algorithms on automata in a way which is very close to the mathematical expression of the algorithm, describes some features of the Vaucanson platform, including the fact that the very rich data structure used to implement automata does not weigh too much on the performance and finally explains the main choices of the programming design that enable to achieve both genericity and efficiency.

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. A. Arnold, A. Dicky, and M. Nivat, A note about minimal non-deterministic automata, Bull. EATCS 47 (1992), 166–169.

    MATH  Google Scholar 

  2. J.-M. Champarnaud and D. Ziadi, Canonical derivatives, partial derivatives and finite automaton constructions, Theor. Comp. Sci. 289 (2002), no. 1, 137–163.

    Article  MATH  MathSciNet  Google Scholar 

  3. J.H. Conway, Regular algebra and finite machines, Chapman and Hall, 1971.

    Google Scholar 

  4. J. Darbon, T. Géraud, and A. Duret-Lutz, Generic implementation of morphological image operators, Int. Symp. on Mathematical Morphology VI (ISMM’2002), April 2002, pp. 175–184.

    Google Scholar 

  5. A. Duret-Lutz, T. Géraud, and A. Demaille, Design patterns for generic programming in C++, Proc. of the 6th USENIX Conf. on Object-Oriented Technologies and Systems (COOTS’01), USENIX Association, 2001, pp. 189–202.

    Google Scholar 

  6. A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Schönherr, On the design of CGAL, the computational geometry algorithms library, Tech. Report 3407, INRIA, April 1998.

    Google Scholar 

  7. E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design patterns: Abstraction and reuse of object-oriented design, LNCS 707 (1993), 406–431.

    Google Scholar 

  8. J. Hopcroft and J. Ullman, Introduction to automata theory, languages and computation, Addison-Wesley, 1979.

    Google Scholar 

  9. S. Lombardy, On the construction of reversible automata for reversible languages, Proc. of ICALP’02, LNCS 2380 (2002), 170–182.

    Google Scholar 

  10. S. Lombardy and J. Sakarovitch, Star height of reversible languages and universal automata, Proc. of LATIN’02, LNCS 2286 (2002), 76–89.

    Google Scholar 

  11. S. Lombardy and J. Sakarovitch, Vaucanson-G, A package for drawing automata and graphs, http://www.liafa.jussieu.fr/~lombardy/Vaucanson-G/, 2002.

  12. S. Lombardy and J. Sakarovitch, On the star height of rational languages, a new presentation for two old results, World Scientific (to appear).

    Google Scholar 

  13. V. Le Maout, Cursors, Proc. of CIAA 2000, LNCS 2088 (2001), 195–207.

    Google Scholar 

  14. O. Matz, A. Miller, A. Potthoff, W. Thomas, E. Valkema, The Program AMoRE, http://www-i7.informatik.rwth-aachen.de/d/research/amore.html, RWTH Aachen, 1995.

  15. O. Matz and A. Potthoff, Computing small nondeterministic finite automata, proc. of TACAS’95, BRICS Notes Series, 1995, pp. 74–88.

    Google Scholar 

  16. M. Mohri, F. C.N. Pereira, and M. Riley, General-purpose Finite-State Machine Software Tools, http://www.research.att.com/sw/tools/fsm/, AT&T Labs — Research, 1997.

  17. D.R. Musser and A.A. Stepanov, Algorithm-oriented generic libraries, Software-Practice and Experience 24 (1994), no. 7, 623–642.

    Article  Google Scholar 

  18. G. van Noord, Finite State Automata Utilities, http://odur.let.rug.nl/~vannoord/Fsa/, 2000.

  19. J. Sakarovitch, Éléments de théorie des automates, Vuibert, 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, Université Paris 7, Paris

    Sylvain Lombardy

  2. LRDE, EPITA, France

    Raphaël Poss & Yann Régis-Gianas

  3. LTCI, CNRS / ENST, France

    Jacques Sakarovitch

Authors
  1. Sylvain Lombardy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raphaël Poss
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yann Régis-Gianas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jacques Sakarovitch
    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 California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA, 99163, USA

    Zhe Dang

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lombardy, S., Poss, R., Régis-Gianas, Y., Sakarovitch, J. (2003). Introducing Vaucanson . In: Ibarra, O.H., Dang, Z. (eds) Implementation and Application of Automata. CIAA 2003. Lecture Notes in Computer Science, vol 2759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45089-0_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45089-0_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40561-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation