Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lombardy, S., Régis-Gianas, Y., Sakarovitch, J.: Introducing vaucanson. Theoretical Computer Science 328, 77–96 (2004)
Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289, 137–163 (2002)
Kuich, W., Walk, K.: Block-stochastic matrices and associated finite-state languages. Computing (Arch. Elektron. Rechnen) 1, 50–61 (1966)
Sakarovitch, J.: Eléments de théorie des automates. Vuibert, Translation: Elements of Automata Theory, Cambridge Universiy Press (to appear, 2003)
Lombardy, S., Sakarovitch, J.: Derivatives of rational expressions with multiplicity. Theoretical Computer Science 332, 141–177 (2005)
Hopcroft, J.: An n log n algorithm for minimizing states in a finite automaton. In: Theory of machines and computations (Proc. Internat. Sympos., Technion, Haifa, 1971), pp. 189–196. Academic Press, New York (1971)
Berstel, J., Carton, O.: On the complexity of hopcroft’s state minimization algorithm. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 35–44. Springer, Heidelberg (2005)
Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155, 291–319 (1996)
Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Develop 9, 47–68 (1965)
Schützenberger, M.P.: On the definition of a family of automata. Information and Control 4, 245–270 (1961)
Eilenberg, S.: Automata, languages, and machines, vol. A. Academic Press [A subsidiary of Harcourt Brace Jovanovich, Publishers], New York (1974); Pure and Applied Mathematics, vol. 58
Berstel, J.: Transductions and context-free languages. Leitfäden der Angewandten Mathematik und Mechanik [Guides to Applied Mathematics and Mechanics], vol. 38. B. G. Teubner, Stuttgart (1979)
Pereira, F., Riley, M.: Speech Recognition by Composition of Weighted Finite Automata. In: Proc. Finite State Devices for Natural Language, MIT Press, Cambridge (1997)
Mohri, M., Pereira, F.C.N., Riley, M.: The design principles of a weighted finite-state transducer library. Theor. Comput. Sci. 231, 17–32 (2000)
Lothaire, M.: Algebraic combinatorics on words. Encyclopedia of Mathematics and its Applications, vol. 90. Cambridge University Press, Cambridge (2002)
Burrus, N., Duret-Lutz, A., Géraud, T., Lesage, D., Poss, R.: A static c++ object-oriented programming (scoop) paradigm mixing benefits of traditional oop and generic programming. In: Proc. of MPOOL 2003, 18th SIGPLAN Conf. (2003)
Régis-Gianas, Y., Poss, R.: On orthogonal specialization in c++: Dealing with efficiency and algebraic abstraction in vaucanson. In: Proc. of POOSC 2003 (2003)
Xerces: http://xml.apache.org/xerces-c/
Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, Reading (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Claveirole, T., Lombardy, S., O’Connor, S., Pouchet, LN., Sakarovitch, J. (2006). Inside Vaucanson. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_10
Download citation
DOI: https://doi.org/10.1007/11605157_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31023-5
Online ISBN: 978-3-540-33097-4
eBook Packages: Computer ScienceComputer Science (R0)