| 2008 |
|---|
| 47 | EE | Akim Demaille,
Alexandre Duret-Lutz,
Florian Lesaint,
Sylvain Lombardy,
Jacques Sakarovitch,
Florent Terrones:
An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions.
FSMNLP 2008: 199-206 |
| 46 | EE | Jacques Sakarovitch,
Rodrigo de Souza:
On the Decidability of Bounded Valuedness for Transducers.
MFCS 2008: 588-600 |
| 45 | EE | Jacques Sakarovitch,
Rodrigo de Souza:
On the decomposition of k-valued rational relations.
STACS 2008: 621-632 |
| 44 | EE | Jacques Sakarovitch,
Rodrigo de Souza:
On the decomposition of k-valued rational relations
CoRR abs/0802.2823: (2008) |
| 43 | EE | Manfred Droste,
Jacques Sakarovitch,
Heiko Vogler:
Weighted automata with discounting.
Inf. Process. Lett. 108(1): 23-28 (2008) |
| 2007 |
|---|
| 42 | EE | Jacques Sakarovitch:
Finite Automata and the Writing of Numbers.
Developments in Language Theory 2007: 29-30 |
| 2006 |
|---|
| 41 | EE | Marie-Pierre Béal,
Sylvain Lombardy,
Jacques Sakarovitch:
Conjugacy and Equivalence of Weighted Automata and Functional Transducers.
CSR 2006: 58-69 |
| 40 | EE | Sylvain Lombardy,
Jacques Sakarovitch:
Sequential?
Theor. Comput. Sci. 356(1-2): 224-244 (2006) |
| 2005 |
|---|
| 39 | EE | Thomas Claveirole,
Sylvain Lombardy,
Sarah O'Connor,
Louis-Noël Pouchet,
Jacques Sakarovitch:
Inside Vaucanson.
CIAA 2005: 116-128 |
| 38 | EE | Jacques Sakarovitch:
The Language, the Expression, and the (Small) Automaton.
CIAA 2005: 15-30 |
| 37 | EE | Marie-Pierre Béal,
Sylvain Lombardy,
Jacques Sakarovitch:
On the Equivalence of -Automata.
ICALP 2005: 397-409 |
| 36 | EE | Sylvain Lombardy,
Jacques Sakarovitch:
Derivatives of rational expressions with multiplicity.
Theor. Comput. Sci. 332(1-3): 141-177 (2005) |
| 2004 |
|---|
| 35 | EE | Sylvain Lombardy,
Jacques Sakarovitch:
How Expressions Can Code for Automata.
LATIN 2004: 242-251 |
| 34 | EE | Sylvain Lombardy,
Yann Régis-Gianas,
Jacques Sakarovitch:
Introducing VAUCANSON.
Theor. Comput. Sci. 328(1-2): 77-96 (2004) |
| 2003 |
|---|
| 33 | EE | Sylvain Lombardy,
Raphaël Poss,
Yann Régis-Gianas,
Jacques Sakarovitch:
Introducing VAUCANSON.
CIAA 2003: 96-107 |
| 32 | | Marie-Pierre Béal,
Olivier Carton,
Christophe Prieur,
Jacques Sakarovitch:
Squaring transducers: an efficient procedure for deciding functionality and sequentiality.
Theor. Comput. Sci. 292(1): 45-63 (2003) |
| 2002 |
|---|
| 31 | EE | Sylvain Lombardy,
Jacques Sakarovitch:
Star Height of Reversible Languages and Universal Automata.
LATIN 2002: 76-90 |
| 30 | EE | Sylvain Lombardy,
Jacques Sakarovitch:
Derivation of Rational Expressions with Multiplicity.
MFCS 2002: 471-482 |
| 29 | EE | Christiane Frougny,
Jacques Sakarovitch:
Two Groups Associated with Quadratic Pisot Units.
IJAC 12(6): 825-847 (2002) |
| 2000 |
|---|
| 28 | | Marie-Pierre Béal,
Olivier Carton,
Christophe Prieur,
Jacques Sakarovitch:
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers.
LATIN 2000: 397-406 |
| 1999 |
|---|
| 27 | EE | Christiane Frougny,
Jacques Sakarovitch:
A Rewrite System Associated with Quadratic Pisot Units.
RTA 1999: 356-370 |
| 26 | EE | Maryse Pelletier,
Jacques Sakarovitch:
On the Representation of Finite Deterministic 2-Tape Automata.
Theor. Comput. Sci. 225(1-2): 1-63 (1999) |
| 1998 |
|---|
| 25 | EE | Christiane Frougny,
Jacques Sakarovitch:
Synchronisation déterministe des automates à délai borné.
Theor. Comput. Sci. 191(1-2): 61-77 (1998) |
| 24 | EE | Jacques Sakarovitch:
A Construction on Finite Automata that has Remained Hidden.
Theor. Comput. Sci. 204(1-2): 205-231 (1998) |
| 1994 |
|---|
| 23 | | Maryse Pelletier,
Jacques Sakarovitch:
On the Lexicographic Uniformisation of Deterministic 2-Tape Automata (Extended Abstract).
IFIP Congress (1) 1994: 485-490 |
| 1993 |
|---|
| 22 | | Christiane Frougny,
Jacques Sakarovitch:
Synchronized Rational Relations of Finite and Infinite Words.
Theor. Comput. Sci. 108(1): 45-82 (1993) |
| 1992 |
|---|
| 21 | | Jacques Sakarovitch:
The "Last" Decision Problem for Rational Trace Languages.
LATIN 1992: 460-473 |
| 1991 |
|---|
| 20 | | Christiane Frougny,
Jacques Sakarovitch:
Rational Ralations with Bounded Delay.
STACS 1991: 50-63 |
| 1990 |
|---|
| 19 | | Maryse Pelletier,
Jacques Sakarovitch:
Easy Multiplications II. Extensions of Rational Semigroups
Inf. Comput. 88(1): 18-59 (1990) |
| 1987 |
|---|
| 18 | | Jacques Sakarovitch:
Easy Multiplications. I. The Realm of Kleene's Theorem
Inf. Comput. 74(3): 173-197 (1987) |
| 17 | | Jacques Sakarovitch:
On Regular Trace Languages.
Theor. Comput. Sci. 52: 59-75 (1987) |
| 1986 |
|---|
| 16 | | Jacques Sakarovitch:
Kleene's theorem revisited.
IMYCS 1986: 39-50 |
| 15 | | Jean Berstel,
Jacques Sakarovitch:
Recent Results in the Theory of Rational Sets.
MFCS 1986: 15-28 |
| 14 | | Fabienne Romian,
Jacques Sakarovitch:
One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages.
MFCS 1986: 554-563 |
| 13 | | M. Benois,
Jacques Sakarovitch:
On the Complexity of Some Extended Word Problems Defined by Cancellation Rules.
Inf. Process. Lett. 23(6): 281-287 (1986) |
| 1985 |
|---|
| 12 | | Jean-Eric Pin,
Jacques Sakarovitch:
Une Application de la Representation Matricielle des Transductions.
Theor. Comput. Sci. 35: 271-293 (1985) |
| 1984 |
|---|
| 11 | | Jacques Sakarovitch,
Taishin Y. Nishida,
Youichi Kobuchi:
Recurrent Words for Substitution.
Mathematical Systems Theory 17(3): 199-215 (1984) |
| 1983 |
|---|
| 10 | | Jean-Eric Pin,
Jacques Sakarovitch:
Some operations and transductions that preserve rationality.
Theoretical Computer Science 1983: 277-288 |
| 9 | | Jacques Sakarovitch:
Deux Remarques sur un Théorème de S. Eilenberg.
ITA 17(1): 23-48 (1983) |
| 1982 |
|---|
| 8 | | Christiane Frougny,
Jacques Sakarovitch,
Erich Valkema:
On the Hotz Group of a Context-Free Grammar.
Acta Inf. 18: 109-115 (1982) |
| 1981 |
|---|
| 7 | | Jacques Sakarovitch:
Description des monoïdes de type fini.
Elektronische Informationsverarbeitung und Kybernetik 17(8/9): 417-434 (1981) |
| 6 | | Jacques Sakarovitch:
Sur une Propriété d'Itération des Langages Algébriques Déterministes.
Mathematical Systems Theory 14: 247-288 (1981) |
| 1979 |
|---|
| 5 | | Jacques Sakarovitch:
Théorème de transversale rationnelle pour les automates à pile déterministes.
Theoretical Computer Science 1979: 276-285 |
| 1977 |
|---|
| 4 | | Jean-François Perrot,
Jacques Sakarovitch:
A Theory of Syntactic Monoids for Context-Free Languages.
IFIP Congress 1977: 69-72 |
| 1976 |
|---|
| 3 | | Jacques Sakarovitch:
Sur les monoïdes syntactiques des langages algébriques déterministes.
ICALP 1976: 52-65 |
| 2 | | Jacques Sakarovitch:
An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages.
MFCS 1976: 510-516 |
| 1975 |
|---|
| 1 | | Jean-François Perrot,
Jacques Sakarovitch:
Langages algébriques déterministes et groupes abeliens.
Automata Theory and Formal Languages 1975: 20-30 |
