BibSonomy publications for /author/Latteux

Substitution of Bounded Rational Cone

dblp — 2011-10-19T00:00:00+02:00

Joffroy Beauquier, and Michel Latteux FOCS, page 236-243. IEEE Computer Society, (1982)

On Computational Power of Weighted Finite Automata.

dblp — 2011-09-12T00:00:00+02:00

Denis Derencourt, Juhani Karhumäki, Michel Latteux, and Alain Terlutte Fundam. Inform. 25(3):285-293 (1996)

Produit dans le Cône Rationnel Engendré par D.

dblp — 2011-09-07T00:00:00+02:00

Michel Latteux Theor. Comput. Sci. 5(2):129-134 (1977)

2-Asynchronous Automata.

dblp — 2011-09-07T00:00:00+02:00

Robert Cori, Eric Sopena, Michel Latteux, and Yves Roos Theor. Comput. Sci. (1988)

Two Characterizations of Rational Adherences.

dblp — 2011-09-07T00:00:00+02:00

Michel Latteux, and Erick Timmerman Theor. Comput. Sci. 46(3):101-106 (1986)

A New Proof of two Theorems about Rational Transductions.

dblp — 2011-09-07T00:00:00+02:00

André Arnold, and Michel Latteux Theor. Comput. Sci. (1979)

Partial Commutations and Faithful Rational Transductions.

dblp — 2011-09-07T00:00:00+02:00

Mireille Clerbout, and Michel Latteux Theor. Comput. Sci. (1984)

A Propos du Lemme de Substitution.

dblp — 2011-09-07T00:00:00+02:00

Michel Latteux Theor. Comput. Sci. (1981)

Representation of Rational Functions with Prefix and Suffix Codings.

dblp — 2011-09-07T00:00:00+02:00

Tero Harju, H. C. M. Kleijn, Michel Latteux, and Alain Terlutte Theor. Comput. Sci. 134(2):403-413 (1994)

Bifaithful Starry Transductions.

dblp — 2011-07-08T00:00:00+02:00

Michel Latteux, and Erick Timmerman Inf. Process. Lett. 28(1):1-4 (1988)

The Inclusion of D0L in MULTI-RESET.

dblp — 2011-07-07T00:00:00+02:00

Mireille Clerbout, and Michel Latteux Inf. Process. Lett. 13(2):45-47 (1981)

On a Language Without Star.

dblp — 2011-07-07T00:00:00+02:00

Michel Latteux Inf. Process. Lett. 16(1):27-30 (1983)

Finitely Generated Omegao-Languages.

dblp — 2011-07-07T00:00:00+02:00

Michel Latteux, and Erick Timmerman Inf. Process. Lett. 23(4):171-175 (1986)

Semi-commutations

dblp — 2011-07-06T00:00:00+02:00

Mireille Clerbout, and Michel Latteux Inf. Comput. 73(1):59-74 (April 1987)

Context-Sensitive String Languages and Eecognizable Picture Languages.

dblp — 2011-07-06T00:00:00+02:00

Michel Latteux, and David Simplot Inf. Comput. 138(2):160-169 (1997)

On Commutative Context-Free Languages.

dblp — 2011-07-05T00:00:00+02:00

Joffroy Beauquier, Meera Blattner, and Michel Latteux J. Comput. Syst. Sci. 35(3):311-320 (1987)

Cônes rationnels commutatifs.

dblp — 2011-07-05T00:00:00+02:00

Michel Latteux J. Comput. Syst. Sci. 18(3):307-333 (1979)

Langages à un Compteur.

dblp — 2011-07-05T00:00:00+02:00

Michel Latteux J. Comput. Syst. Sci. 26(1):14-33 (1983)

Commutative One-Counter Languages are Regular.

dblp — 2011-07-05T00:00:00+02:00

Michel Latteux, and Grzegorz Rozenberg J. Comput. Syst. Sci. 29(1):54-57 (1984)

Languages Defined by Generalized Equality Sets.

dblp — 2011-07-05T00:00:00+02:00

Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, and Michel Latteux FCT, volume 2751 of Lecture Notes in Computer Science, page 355-363. Springer, (2003)