Introducing VAUCANSON

Theoretical Computer Science

Volumn 328, Issue 1-2, 2004, Pages 77-96

  Lombardy, Sylvain ^a   Régis Gianas, Yann ^b   Sakarovitch, Jacques ^c  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b EPITA RESEARCH AND DEVELOPMENT LABORATORY LRDE   (France)

^c INSTITUT TELECOM   (France)

Author keywords

Automata implementation; Automata with multiplicity; Generic programming

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; DATA STRUCTURES; DYNAMIC PROGRAMMING; FINITE AUTOMATA; SET THEORY; TRANSDUCERS;

AUTOMATA IMPLEMENTATION; AUTOMATA WITH MULTIPLICITY; GENERIC PROGRAMMING; PROGRAMMING DESIGNS;

COMPUTER SOFTWARE;

EID: 9544234494     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.07.007     Document Type: Conference Paper

References (23)

1. A. Arnold, A. Dicky, M. Nivat, A note about minimal non-deterministic automata, Bull. EATCS 47 (1992) 166-169.
2. L. Augustsson, Cayenne a language with dependent types, Internat. Conf. on Functional Programming, 1998.
3. G. Castagna, Object-Oriented Programming: A Unified Foundation, Progress in Theoretical Computer Science Series, Birkhauser, Basel, 1997.
4. J.-M. Champarnaud, D. Ziadi, Canonical derivatives, partial derivatives and finite automaton constructions, Theoret. Comput. Sci. 289 (1) (2002) 137-163.
5. J.H. Conway, Regular Algebra and Finite Machines, Chapman and Hall, London, 1971.
6. J. Darbon, T. Géraud, A. Duret-Lutz, Generic implementation of morphological image operators, Internat. Symp. on Mathematical Morphology VI (ISMM'2002), April 2002, pp. 175-184.
7. A. Duret-Lutz, T. Géraud, A. Demaille, Design patterns for generic programming in C++, Proc. Sixth USENIX Conf. on Object-Oriented Technologies and Systems (COOTS'01), USENIX Association, 2001, pp. 189-202.
8. A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, S. Sahönherr, On the design of CGAL, the computational geometry algorithms library, Technical Report 3407, INRIA, April 1998.
9. E. Gamma, R. Helm, R. Johnson, J. Vlissides, Design Patterns: Abstraction and Reuse of Object-Oriented Design, Lecture Notes in Computer Science, Vol. 707, 1993, pp. 406-431.
10. J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
11. V. Le Maout, Cursors, Proc. of CIAA 2000, Lecture Notes in Computer Science, Vol. 2088,2001, pp. 195-207.
12. S. Lombardy, On the construction of reversible automata for reversible languages, Proc. of ICALP'02, Lecture Notes in Computer Science, Vol. 2380, 2002, pp. 170-182.
13. S. Lombardy, J. Sakarovitch, Star height of reversible languages and universal automata, Proc. of LATIN'02, Lecture Notes in Computer Science, Vol. 2286, 2002, pp. 76-89.
14. S. Lombardy, J. Sakarovitch, Vaucanson-G, A package for drawing automata and graphs, http://www.liafa.jussieu.fr/~lombardy/Vaucanson-G/, 2002.
15. S. Lombardy, J. Sakarovitch, On the star height of rational languages, a new presentation for two old results, in: M. Ito, T. Imaoka (Eds.), Proc. of Words, Languages & Combinatorics III, World Scientific, Singapore, 2003, pp. 266-285.
16. O. Matz, A. Miller, A. Potthoff, W. Thomas, E. Valkema, The Program AMoRE, http://www-17.informatik.rwth-aachen.de/d/research/amore.html, RWTH Aachen, 1995.
17. O. Matz, A. Potthoff, Computing small nondeterministic finite automata, Proc. of TAC AS'95, BRICS Notes Series, 1995, pp. 74-88.
18. M. Mohri, F.C.N. Pereira, M. Riley, General-purpose Finite-State Machine Software Tools, http://www.research.att.com/sw/tools/fsm/, AT&T Labs - Research, 1997.
19. D.R. Musser, A.A. Stepanov, Algorithm-oriented generic libraries, Software Pract. Exper. 24 (7) (1994) 623-642.
20. Y. Régis-Gianas, R. Poss, On orthogonal specialization in C++: dealing with efficiency and algebraic abstraction in Vaucanson, Proc. of POOSC'2003, Darmstadt, July 2003.
21. J. Sakarovitch, Éléments de théorie des automates, Vuibert, 2003. English translation: Element of Automata Theory, Cambridge University Press, to appear.
22. G. van Noord, Finite State Automata Utilities, http://odur.let.rug.nl/ ~vannoord/Fsa/,2000.
23. H. Xi, F. Pfenning, Dependent types in practical programming, Proc. of POPL'1999, 1999, pp. 214-227.