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="Latteux, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Context-sensitive string languages and recognizable picture languages
M. Latteux
,
D. Simplot
Information and Computation
138
(2), 1997, pp. 160-169
Representation of rational functions with prefix and suffix codings
T. Harju
,
H.C.M. Kleijn
,
M. Latteux
,
A. Terlutte
Theoretical Computer Science
134
(2), 1994, pp. 403-413
Semi-commutations and rational expressions
M. Clerbout
,
M. Latteux
,
Y. Roos
,
W. Zielonka
Lecture Notes in Computer Science
623
, 1992, pp. 113-125
On computational power of weighted finite automata
D. Derencourt
,
J. Karhumäki
,
M. Latteux
,
A. Terlutte
Lecture Notes in Computer Science
629
, 1992, pp. 236-245
Deterministic sequential functions
T. Harju
,
H.C.M. Kleijn
,
M. Latteux
Acta Informatica
29
, 1992, pp. 545-554
Rational
\omega
-transductions
M. Latteux
,
E. Timmerman
Lecture Notes in Computer Science
452
, 1990, pp. 407-415
Bifaithful starry transductions
M. Latteux
,
E. Timmerman
Information Processing Letters
28
(1), 1988, May, pp. 1-4
On commutative context-free languages
J. Beauquier
,
M. Blattner
,
M. Latteux
Journal of Computer and System Sciences
35
(3), 1987, December, pp. 311-320
Semi-commutations
M. Clerbout
,
M. Latteux
Information and Computation
73
(1), 1987, pp. 59-74
Finitely generated
\omega
-languages
M. Latteux
,
E. Timmerman
Information Processing Letters
23
(4), 1986, November, pp. 171-175
Two characterizations of rational adherences
M. Latteux
,
E. Timmerman
Theoretical Computer Science
46
(1), 1986, pp. 101-106
The family of one-counter languages is closed under quotient
M. Latteux
,
B. Leguy
,
B. Ratoandromanana
Acta Informatica
22
(5), 1985, pp. 579-588
Partial commutations and faithful rational transductions
M. Clerbout
,
M. Latteux
Theoretical Computer Science
34
(3), 1984, pp. 241-254
Commutative one/counter languages are regular
M. Latteux
,
G. Rozenberg
Journal of Computer and System Sciences
29
(1), 1984, August, pp. 54-57
On a language without star
M. Latteux
Information Processing Letters
16
(1), 1983, January, pp. 27-30
Restricted one counter languages
M. Latteux
Journal of Computer and System Sciences
26
(1), 1983, February, pp. 14-33
Substitution of bounded rational cone
J. Beauquier
,
M. Latteux
Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'82 (Chicago, IL, November 3-5, 1982)
, 1982, pp. 236-243
The inclusion of d0l in multi-reset
M. Clerbout
,
M. Latteux
Information Processing Letters
13
(2), 1981, November, pp. 45-47
A propos de lemme de substitution (Note)
M. Latteux
Theoretical Computer Science
14
, 1981, pp. 119-123
Algebraic and linear generators
M. Latteux
Acta Informatica
13
(4), 1980, May, pp. 347-363
A new proof of two theorems about rational transductions
A. Arnold
,
M. Latteux
Theoretical Computer Science
8
(2), 1979, pp. 261-263
Sur deux langages linéaires
M. Latteux
Lecture Notes in Computer Science
67
, 1979, pp. 182-189
Rational commutative trios
M. Latteux
Journal of Computer and System Sciences
18
(3), 1979, June, pp. 307-333
Intersections of bounded algebraic languages
M. Latteux
Acta Informatica
11
(3), 1979, pp. 233-240
Produit dans le cône rationnel engendré par
D^*1
M. Latteux
Theoretical Computer Science
5
(2), 1977, pp. 129-134