Author name cluster

M. Latteux

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

5 papers

1 author row

I&C Journal 1997 Journal Article

Context-Sensitive String Languages and Recognizable Picture Languages

M. Latteux
D. Simplot

The theorem stating that the family of frontiers of recognizable tree languages is exactly the family of context-free languages (see J. Mezei and J. B. Wright, 1967, Inform. and Comput. 11, 3–29), is a basic result in the theory of formal languages. In this article, we prove a similar result: the family of frontiers of recognizable picture languages is exactly the family of context-sensitive languages

Details DOI

TCS Journal 1994 Journal Article

Representation of rational functions with prefix and suffix codings

T. Harju
H.C.M. Kleijn
M. Latteux
A. Terlutte

We proceed with the characterization of rational functions by means of restricted class of morphisms. Left subsequential transductions can be factored in an endmarking followed by an uniform morphism, the inverse of a prefix morphism and an alphabetic morphism. Rational functions require the inverse of a prefix morphism followed by the inverse of a suffix morphism.

Details DOI

I&C Journal 1987 Journal Article

Semi-commutations

M. Clerbout
M. Latteux

We extend the notion of partial commutation by introducing that of semi-commutation which is its non-symetrical version. A semi-commutation function f is associated to a semi-Thue system 〈X, P〉 where the rules are of the form yx → xy with x, y ϵ X. We study this operation in connection with rational operations. We prove that if f(R) and f(R′) are regular languages then f(RR′) is a regular language and we give a sufficient condition which ensures that f(R∗) is a regular language.

Details DOI

TCS Journal 1986 Journal Article

Two characterizations of rational adherences

M. Latteux
E. Timmerman

We present two characterizations of rational adherences in terms of finite sets, strictly alphabetic morphisms and inverse uniform morphisms. We deduce a similar characterization for rational ω-languages.

Details DOI

TCS Journal 1984 Journal Article

Partial commutations and faithful rational transductions

M. Clerbout
M. Latteux

We study the operation of partial commutation in connection with other operations such as partitioned commutation, twin shuffle, intersection and faithful rational transductions. From that study we get a very simple characterization for the following families of languages: Multi-Reset, BNP and Q the family of quasirealtime languages.

Details DOI