Introducing VAUCANSON

Authors:
Sylvain Lombardy;Raphaël Poss;Yann Régis-Gianas;Jacques Sakarovitch
Affiliations:
LIAFA, Université Paris 7;LRDE, EPITA;LRDE, EPITA;LTCI, CNRS, ENST
Venue:
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Year:
2003

Citing 7
Cited 4

Algorithm-oriented generic libraries

Software—Practice & Experience
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Canonical derivatives, partial derivatives and finite automaton constructions

Theoretical Computer Science
Design Patterns: Abstraction and Reuse of Object-Oriented Design

ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
On the Construction of Reversible Automata for Reversible Languages

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Star Height of Reversible Languages and Universal Automata

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Design patterns for generic programming in C++

COOTS'01 Proceedings of the 6th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 6

C-Transformers: a framework to write C program transformations

Crossroads
An analogical learner for morphological analysis

CONLL '05 Proceedings of the Ninth Conference on Computational Natural Language Learning
The language, the expression, and the (small) automaton

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Implementation concepts in vaucanson 2

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

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.