Difference between revisions of "Jobs/M2 AD 2015 Vcsn for Linguists"
From LRDE
(Created page with "{{Job |Reference id=2015 AD Vcsn for Linguists |Title=Vcsn for Linguists |Language=en }}") |
|||
Line 2: | Line 2: | ||
|Reference id=2015 AD Vcsn for Linguists |
|Reference id=2015 AD Vcsn for Linguists |
||
|Title=Vcsn for Linguists |
|Title=Vcsn for Linguists |
||
+ | |Dates=5-6 months in 2015 |
||
+ | |Research field=Automata Theory |
||
+ | |Related project=Vaucanson |
||
+ | |Advisor=Akim Demaille |
||
+ | |General presentation of the field=Many properties and characteristics of an automaton can be easily computed from its syntactic monoids. Such properties are of particular importance to theoreticians. |
||
+ | |||
+ | Vcsn is a project led by Alexandre Duret-Lutz and Akim Demaille (LRDE). It is a platform for the manipulation of automata, transducers and weighted rational expressions. It is written in C++11 avoiding the classical object-oriented programming in favor of generic programming (template) for more performance. Vcsn is an heir of the Vaucanson 2 project which was developed in partnership with Jacques Sakarovitch (Telecom ParisTech) and Sylvain Lombardy (LaBRI). |
||
+ | |||
+ | Vcsn has a sound base of data structure and algorithms for automata and rational expressions. However, it offers no support for syntactic monoids at all. |
||
+ | |Prerequisites=* good programmer in some language |
||
+ | * acquaintance with C++ |
||
+ | * facilities with theoretical matters |
||
+ | |Objectives=The objective of this internship is develop support for syntactic monoids in Vcsn, and to implement recent research results in Automata Theory that use the syntactic monoid. |
||
+ | |References=* [http://www.amazon.com/Elements-Automata-Theory-Jacques-Sakarovitch/dp/0521844258 Jacques Sakarovitch, “Elements of Automata Theory,” Cambridge University Press.] |
||
+ | * [http://publications.lrde.epita.fr/201307-CIAA Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Jacques Sakarovitch. “Implementation Concepts in Vaucanson 2,” CIAA’13.] |
||
+ | |||
+ | |Contact=<akim at lrde . epita . fr> |
||
+ | |Compensation=1000 € gross/month |
||
+ | |Type=Master Internship |
||
|Language=en |
|Language=en |
||
}} |
}} |
Revision as of 14:39, 29 October 2014
Vcsn for Linguists | |
---|---|
Reference id |
2015 AD Vcsn for Linguists |
Dates |
5-6 months in 2015 |
Research field |
Automata Theory |
Related project | |
Advisor | |
General presentation of the field |
Many properties and characteristics of an automaton can be easily computed from its syntactic monoids. Such properties are of particular importance to theoreticians. Vcsn is a project led by Alexandre Duret-Lutz and Akim Demaille (LRDE). It is a platform for the manipulation of automata, transducers and weighted rational expressions. It is written in C++11 avoiding the classical object-oriented programming in favor of generic programming (template) for more performance. Vcsn is an heir of the Vaucanson 2 project which was developed in partnership with Jacques Sakarovitch (Telecom ParisTech) and Sylvain Lombardy (LaBRI). Vcsn has a sound base of data structure and algorithms for automata and rational expressions. However, it offers no support for syntactic monoids at all. |
Prerequisites |
|
Objectives |
The objective of this internship is develop support for syntactic monoids in Vcsn, and to implement recent research results in Automata Theory that use the syntactic monoid. |
Benefit for the candidate | |
References | |
Place | LRDE: How to get to us |
Compensation |
1000 € gross/month |
Future work opportunities | |
Contact |