Inside Vaucanson

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3845 LNCS, Issue , 2006, Pages 116-128

  Claveirole, Thomas ^a   Lombardy, Sylvain ^b   O'Connor, Sarah ^a   Pouchet, Louis Noël ^a   Sakarovitch, Jacques ^c  

^a EPITA RESEARCH AND DEVELOPMENT LABORATORY LRDE   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c INSTITUT TELECOM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX DECLARATIONS; VAUCANSON PLATFORM; WEIGHTED AUTOMATON; XML FORMAT;

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; GENETIC ALGORITHMS; TRANSDUCERS; XML;

AUTOMATA THEORY;

EID: 33745172094     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605157_10     Document Type: Conference Paper

References (19)

1. Lombardy, S., Régis-Gianas, Y., Sakarovitch, J.: Introducing VAUCANSON, Theoretical Computer Science 328 (2004) 77-96
2. Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289 (2002) 137-163
3. Kuich, W., Walk, K.: Block-stochastic matrices and associated finite-state languages, Computing (Arch, Eletron. Rechnen) 1(1966) 50-61
4. Sakarovitch, J.: Eléments de théorie des automates. Vuibert (2003) Translation: Elements of Automata Theory, Cambridge Universiy Press, to appear.
5. Lombardy, S., Sakarovitch, J.: Derivatives of rational expressions with multiplicity. Theoretical Computer Science 332 (2005) 141-177
6. 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). Academic Press, New York (1971) 189-196
7. Berstel, J., Carton, O.: On the complexity of hopcroft's state minimization algorithm. In Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S., eds.: CIAA. Volume 3317 of Lecture Notes in Computer Science., Springer (2004) 35-44
8. Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155 (1996) 291-319
9. Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Develop 9 (1965) 47-68
10. Schützenberger, M.P.: On the definition of a family of automata. Information and Control 4 (1961) 245-270
11. 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.
12. Berstel, J.: Transductions and context-free languages. Volume 38 of Leitfäden der Angewandten Mathematik und Mechanik [Guides to Applied Mathematics and Mechanics], B. G. Teubner, Stuttgart (1979)
13. Pereira, F., Riley, M.: Speech Recognition by Composition of Weighted Finite Automata, In: Finite State Devices for Natural Language, Proc. MIT Press (1997)
14. Mohri, M., Pereira, F.C.N., Riley, M.: The design principles of a weighted finite-state transducer library, Theor. Comput. Sci. 231 (2000) 17-32
15. Lothaire, M.: Algebraic combinatorics on words. Volume 90 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (2002)
16. Burrus, N., Duret-Lutz, A., Ǵ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'03, 18th SIGPLAN Conf. (2003)
17. Régis-Gianas, Y., Poss, R.: On orthogonal speciali:zation in c++: Dealing with efficiency and algebraic abstraction in vaucanson. In: Proc. of POOSC'2003. (2003)
18. Xerces: (http://xml.apache.org/xerces-c/)
19. Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley (1995)