Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
Partial derivatives of regular expressions and finite automaton constructions
Theoretical Computer Science
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Automata, Languages, and Machines
Automata, Languages, and Machines
Canonical derivatives, partial derivatives and finite automaton constructions
Theoretical Computer Science
Theoretical Computer Science - Implementation and application of automata
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
Elements of Automata Theory
On relations defined by generalized finite automata
IBM Journal of Research and Development
On the complexity of hopcroft’s state minimization algorithm
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
An efficient computation of the equation K-automaton of a regular K-expression
DLT'07 Proceedings of the 11th international conference on Developments in language theory
State complexity of union and intersection of finite languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
| Hi-index | 0.00 |
This paper presents some features of the Vaucanson platform. We describe some original algorithms on weighted automata and transducers (computation of the quotient, conversion of a regular expression into a weighted automaton, and composition). We explain how complex declarations due to the generic programming are masked from the user and finally we present a proposal for an XML format that allows implicit descriptions for simple types of automata.