The following pages link to Gabriel Thierrin (Q675055):
Displayed 50 items.
- Contextual insertions/deletions and computability (Q675056) (← links)
- Maximal and minimal solutions to language equations (Q676452) (← links)
- Sur la théorie des demi-groupes (Q766959) (← links)
- Sur les automorphismes interieurs d'un demi-groupe reductif (Q767915) (← links)
- Contribution à la théorie des anneaux et des demi-groupes (Q768812) (← links)
- Sur les idéaux fermatiens d'un anneau commutatif (Q770537) (← links)
- (Q1091481) (redirect page) (← links)
- Monoids with disjunctive identity and their codes (Q1091482) (← links)
- Relatively f-disjunctive languages (Q1105049) (← links)
- Right subdirectly irreducible semigroups (Q1140166) (← links)
- Strong endomorphisms of \(\Pi\)-connected automata (Q1143802) (← links)
- Semigroups with each element disjunctive (Q1149523) (← links)
- Languages whose \(n\)-element subsets are codes (Q1184989) (← links)
- Outfix and infix codes and related classes of languages (Q1186552) (← links)
- A mode of decomposition of regular languages (Q1218282) (← links)
- An algebraic dependence over the quasi-centre (Q1235239) (← links)
- Right local semigroups (Q1239282) (← links)
- Regular prefix codes and right power-bounded languages (Q1241492) (← links)
- Monogenic \(e\)-closed languages and dipolar words (Q1318822) (← links)
- Right \(k\)-dense languages (Q1322582) (← links)
- On the robustness of primitive words (Q1348393) (← links)
- Congruences, infix and cohesive prefix codes (Q1349710) (← links)
- Insertion and deletion closure of languages (Q1391134) (← links)
- Shuffle and scattered deletion closure of languages (Q1575737) (← links)
- Tree-systems of morphisms (Q1608934) (← links)
- E-convex infix codes (Q1820251) (← links)
- Disjunctive decomposition of languages (Q1822508) (← links)
- Anti-commutative languages and n-codes (Q1823000) (← links)
- fd-domains and rf-disjunctive languages (Q1825680) (← links)
- Languages and monoids with disjunctive identity (Q1911748) (← links)
- Finiteness conditions for finitely generated monoids (Q2560330) (← links)
- The syntactic monoid of a hypercode (Q2560906) (← links)
- The syntactic monoid of hairpin-free languages (Q2641875) (← links)
- (Q3125166) (← links)
- (Q3129289) (← links)
- The Syntactic Monoid of an Infix Code (Q3197337) (← links)
- (Q3208091) (← links)
- Strict Linear Programs and Tight Matrices (Q3221751) (← links)
- (Q3231196) (← links)
- (Q3246457) (← links)
- (Q3253832) (← links)
- Sur le Radical Corpoïdal D'un Anneau (Q3267483) (← links)
- (Q3327733) (← links)
- On?-Languages whose syntactic monoid is trivial (Q3335014) (← links)
- (Q3335015) (← links)
- (Q3345795) (← links)
- (Q3347325) (← links)
- Hairpin Structures in DNA Words (Q3618686) (← links)
- Semi-discrete context-free languages<sup>†</sup> (Q3660939) (← links)
- (Q3671382) (← links)