The following pages link to Michel Latteux (Q498406):
Displaying 50 items.
- A canonical automaton for one-rule length-preserving string rewrite systems (Q498407) (← links)
- Sur les générateurs algébriques et linéaires (Q599515) (← links)
- Intersections de langages algébriques bornes (Q754651) (← links)
- (Q799382) (redirect page) (← links)
- Partial commutations and faithful rational transductions (Q799383) (← links)
- Commutative one-counter languages are regular (Q800097) (← links)
- Equality sets of prefix morphisms and regular star languages (Q1041740) (← links)
- The family of one-counter languages is closed under quotient (Q1070828) (← links)
- Finitely generated \(\omega\)-languages (Q1092671) (← links)
- On commutative context-free languages (Q1092674) (← links)
- Semi-commutations (Q1094144) (← links)
- 2-asynchronous automata (Q1109571) (← links)
- Bifaithful starry transductions (Q1116707) (← links)
- The meet operation in the lattice of codes (Q1127316) (← links)
- Cônes rationnels commutatifs (Q1133330) (← links)
- Recursivite et cônes rationnels fermés par intersection (Q1133331) (← links)
- A propos du lemme de substitution (Q1149786) (← links)
- The inclusion of D0L in multi-reset (Q1162162) (← links)
- On a language without star (Q1172399) (← links)
- Problèmes decidables concernant les TOL-langages unaires (Q1242453) (← links)
- Produit dans le cône rationnel engendre par D (Q1242699) (← links)
- A new proof of two theorems about rational transductions (Q1255326) (← links)
- On characterizations of recursively enumerable languages (Q1262786) (← links)
- Composed figures of pixels and inverse monoid (Q1280230) (← links)
- Deterministic sequential functions (Q1323370) (← links)
- Representation of rational functions with prefix and suffix codings (Q1341724) (← links)
- Context-sensitive string languages and recognizable picture languages (Q1376420) (← links)
- Recognizable picture languages and domino tiling (Q1391540) (← links)
- Mixed languages (Q1770385) (← links)
- Commutation with ternary sets of words (Q1771315) (← links)
- Two characterizations of rational adherences (Q1822510) (← links)
- Langages à un compteur (Q1838045) (← links)
- On prefixal one-rule string rewrite systems (Q2330116) (← links)
- Extension of the decidability of the marked PCP to instances with unique blocks (Q2373757) (← links)
- Commutation with codes (Q2484442) (← links)
- Identification of birfsa languages. (Q2490821) (← links)
- (Q2893310) (← links)
- Motifs et bases de langages (Q3031947) (← links)
- (Q3345795) (← links)
- (Q3358244) (← links)
- (Q3396566) (← links)
- Minimal NFA and biRFSA Languages (Q3625690) (← links)
- (Q3660937) (← links)
- Semi-discrete context-free languages<sup>†</sup> (Q3660939) (← links)
- (Q3674079) (← links)
- (Q3707423) (← links)
- (Q3723719) (← links)
- (Q3740264) (← links)
- On the usefulness of bifaithful rational cones (Q3741081) (← links)
- (Q3774974) (← links)
