Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Sakarovitch, Jacques"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Radix cross-sections for length morphisms
Sylvain Lombardy
,
Jacques Sakarovitch
Lecture Notes in Computer Science
6034
, 2010, pp. 184-195
Lexicographic decomposition of
k
-valued transducers
Jacques Sakarovitch
,
Rodrigo de Souza
Theory of Computing Systems
47
(3), 2010, pp. 758-785
Weighted automata with discounting
Manfred Droste
,
Jacques Sakarovitch
,
Heiko Vogler
Information Processing Letters
108
(1), 2008, pp. 23-28
On the decidability of bounded valuedness for transducers
Jacques Sakarovitch
,
Rodrigo de Souza
Lecture Notes in Computer Science
5162
, 2008, pp. 588-600
On the decomposition of k-valued rational relations
Jacques Sakarovitch
,
Rodrigo de Souza
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 621-632
Sequential?
Sylvain Lombardy
,
Jacques Sakarovitch
Theoretical Computer Science
356
(1-2), 2006, pp. 224-244
On the equivalence of
Z
-automata
Marie-Pierre Béal
,
Sylvain Lombardy
,
Jacques Sakarovitch
Lecture Notes in Computer Science
3580
, 2005, pp. 397-409
Derivatives of rational expressions with multiplicity
Sylvain Lombardy
,
Jacques Sakarovitch
Theoretical Computer Science
332
(1-3), 2005, pp. 141-177
Introducing
Vaucanson
Sylvain Lombardy
,
Yann Régis-Gianas
,
Jacques Sakarovitch
Theoretical Computer Science
328
(1-2), 2004, pp. 77-96
Squaring transducers: An efficient procedure for deciding functionality and sequentiality
Marie-Pierre Béal
,
Olivier Carton
,
Christophe Prieur
,
Jacques Sakarovitch
Theoretical Computer Science
292
(1), 2003, pp. 45-63
The finite power property in free groups
Flavio d'Alessandro
,
Jacques Sakarovitch
Theoretical Computer Science
293
(1), 2003, pp. 55-82
Derivation of rational expressions with multiplicity
Sylvain Lombardy
,
Jacques Sakarovitch
Lecture Notes in Computer Science
2420
, 2002, pp. 471-482
On the representation of finite deterministic 2-tape automata
Maryse Pelletier
,
Jacques Sakarovitch
Theoretical Computer Science
225
(1-2), 1999, pp. 1-63
Synchronisation déterministe des automates à délai borné
Christiane Frougny
,
Jacques Sakarovitch
Theoretical Computer Science
191
(1-2), 1998, pp. 61-77
A construction on finite automata that has remained hidden
Jacques Sakarovitch
Theoretical Computer Science
204
(1-2), 1998, pp. 205-231
Synchronized rational relations of finite and infinite words
Christiane Frougny
,
Jacques Sakarovitch
Theoretical Computer Science
108
, 1993, pp. 45-82
The ``last'' decision problem for rational trace languages
Jacques Sakarovitch
Lecture Notes in Computer Science
583
, 1992, pp. 460-473
Rational relations with bounded delay
Christiane Frougny
,
Jacques Sakarovitch
Lecture Notes in Computer Science
480
, 1991, pp. 50-63
Easy multiplications. II. Extensions of rational semigroups
Maryse Pelletier
,
Jacques Sakarovitch
Information and Computation
88
(1), 1990, pp. 18-59
Easy multiplications. I. The realm of Kleene's theorem
Jacques Sakarovitch
Information and Computation
74
(3), 1987, September, pp. 173-197
Recurrent words for substitution
Jacques Sakarovitch
,
Taishin Nishida
,
Youichi Kobuchi
Math. Systems Theory
17
, 1984, pp. 199-215
Sur une propriété d'itération des langages algébriques déterministes
Jacques Sakarovitch
Math. Systems Theory
14
, 1981, pp. 247-288