Permutation Automata. - Gabriel Thierrin (Math. Syst. Theory, 1968)

Simple automata. - Gabriel Thierrin (Kybernetika, 1970)

Convex Languages. - Gabriel Thierrin (ICALP, 1972)

Power-Separating Regular Languages. - Huei-Jan Shyr; Gabriel Thierrin (Math. Syst. Theory, 1974)

Hypercodes - Huei-Jan Shyr; Gabriel Thierrin (Inf. Control., 1974)

Preorder Relations Associated with Developmental Systems and Languages. - Huei-Jan Shyr; Gabriel Thierrin (Automata, Languages, Development, 1975)

Left-noncounting languages. - Huei-Jan Shyr; Gabriel Thierrin (Int. J. Parallel Program., 1975)

Disjunctive Languages and Codes. - Huei-Jan Shyr; Gabriel Thierrin (FCT, 1977)

Codes, Languages and MOL Schemes. - Huei-Jan Shyr; Gabriel Thierrin (RAIRO Theor. Informatics Appl., 1977)

Strong endomorphisms of automata. - Andre D. Paradis; Gabriel Thierrin (FCT, 1979)

Reflective Star Languages and Codes - C. M. Reis; Gabriel Thierrin (Inf. Control., 1979)

Hypercodes in Deterministic and Slender 0L Languages - Tom Head; Gabriel Thierrin (Inf. Control., 1980)

H-Bounded and Semi-discrete Languages - M. Kunze; Huei-Jan Shyr; Gabriel Thierrin (Inf. Control., 1981)

Disjunctive omega-Languages. - Helmut Jürgensen; Huei-Jan Shyr; Gabriel Thierrin (J. Inf. Process. Cybern., 1983)

Onω-Languages whose syntactic monoid is trivial. - Helmut Jürgensen; Gabriel Thierrin (Int. J. Parallel Program., 1983)

DOL Schemes and the Periodicity of String Embeddings. - Tom Head; Gabriel Thierrin; John Wilkinson (Theor. Comput. Sci., 1983)

On Bounded Context-free Languages. - Michel Latteux; Gabriel Thierrin (J. Inf. Process. Cybern., 1984)

Which Monoids are Syntactic Monoids of omega-Languages? - Helmut Jürgensen; Gabriel Thierrin (J. Inf. Process. Cybern., 1986)

Disjunctive Decomposition of Languages. - Y. Q. Guo; G. W. Xu; Gabriel Thierrin (Theor. Comput. Sci., 1986)

Anti-commutative languages and n-codes. - Masami Ito; Helmut Jürgensen; Huei-Jan Shyr; Gabriel Thierrin (Discret. Appl. Math., 1989)

Disjunctive Languages and Compatible Orders. - Masami Ito; Huei-Jan Shyr; Gabriel Thierrin (RAIRO Theor. Informatics Appl., 1989)

Outfix and Infix Codes and Related Classes of Languages. - Masami Ito; Helmut Jürgensen; Huei-Jan Shyr; Gabriel Thierrin (J. Comput. Syst. Sci., 1991)

Languages Whose n-Element Subsets Are Codes. - Masami Ito; Helmut Jürgensen; Huei-Jan Shyr; Gabriel Thierrin (Theor. Comput. Sci., 1992)

Aperiodic Languages and Generalizations. - Lila Kari; Gabriel Thierrin (Mathematical Aspects of Natural and Formal Languages, 1994)

Monogenic e-closed languages and dipolar words. - Huei-Jan Shyr; S. S. Yu; Gabriel Thierrin (Discret. Math., 1994)

Congruences, Infix and Cohesive Prefix Codes. - Masami Ito; Gabriel Thierrin (Theor. Comput. Sci., 1994)

Morphisms and Associated Congruences. - Lila Kari; Gabriel Thierrin (Developments in Language Theory, 1995)

Contextual Insertions/Deletions and Computability. - Lila Kari; Gabriel Thierrin (Inf. Comput., 1996)

Omega-Syntactic Congruences. - Lila Kari; Gabriel Thierrin (J. Autom. Lang. Comb., 1996)

Maximal and Minimal Solutions to Language Equations. - Lila Kari; Gabriel Thierrin (J. Comput. Syst. Sci., 1996)

At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems. - Lila Kari; Gheorghe Paun; Gabriel Thierrin; Sheng Yu 001 (DNA Based Computers, 1997)

Morphisms and Primitivity. - Gheorghe Paun; Gabriel Thierrin (Bull. EATCS, 1997)

Insertion and Deletion Closure of Languages. - Masami Ito; Lila Kari; Gabriel Thierrin (Theor. Comput. Sci., 1997)

Multiset Processing by Means of Systems of Finite State Transducers. - Gheorghe Paun; Gabriel Thierrin (WIA, 1999)

Shuffle and scattered deletion closure of languages. - Masami Ito; Lila Kari; Gabriel Thierrin (Theor. Comput. Sci., 2000)

Insertion of languages and differential semirings. - Gabriel Thierrin (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

Tree-systems of morphisms. - Jürgen Dassow; Gheorghe Paun; Gabriel Thierrin; Sheng Yu 001 (Acta Informatica, 2001)

Morphisms preserving densities. - Helmut Jürgensen; Lila Kari; Gabriel Thierrin (Int. J. Comput. Math., 2001)

Codes, Involutions, and DNA Encodings. - Lila Kari; Rob Kitto; Gabriel Thierrin (Formal and Natural Computing, 2002)

On the robustness of primitive words. - Gheorghe Paun; Nicolae Santean; Gabriel Thierrin; Sheng Yu 001 (Discret. Appl. Math., 2002)

On Hairpin-Free Words and Languages. - Lila Kari; Stavros Konstantinidis; Petr Sosík; Gabriel Thierrin (Developments in Language Theory, 2005)

Hairpin Structures in DNA Words. - Lila Kari; Stavros Konstantinidis; Elena Losseva; Petr Sosík; Gabriel Thierrin (DNA, 2005)

A Formal Language Analysis of DNA Hairpin Structures. - Lila Kari; Elena Losseva; Stavros Konstantinidis; Petr Sosík; Gabriel Thierrin (Fundam. Informaticae, 2006)

The syntactic monoid of hairpin-free languages. - Lila Kari; Kalpana Mahalingam; Gabriel Thierrin (Acta Informatica, 2007)