Introducing VAUCANSON

DOI10.1016/j.tcs.2004.07.007zbMath1071.68046OpenAlexW2336662920MaRDI QIDQ703498

Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.007

zbMATH Keywords

Automata implementationAutomata with multiplicityGeneric programming

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Random Deterministic Automata ⋮ OpenFst: A General and Efficient Weighted Finite-State Transducer Library ⋮ UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION ⋮ HFST Tools for Morphology – An Efficient Open-Source Package for Construction of Morphological Analyzers ⋮ From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity ⋮ COMPAS - A Computing Package for Synchronization ⋮ Implementation of Code Properties via Transducers

Uses Software

• CGAL
• Vaucanson
• Cayenne

Cites Work

• Canonical derivatives, partial derivatives and finite automaton constructions.
• On the design of CGAL a computational geometry algorithms library
• Cayenne—a language with dependent types
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Introducing VAUCANSON