Gabriel Thierrin

According to our database, Gabriel Thierrin authored at least 44 papers between 1968 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

The syntactic monoid of hairpin-free languages.

Lila Kari, Kalpana Mahalingam, Gabriel Thierrin

Acta Informatica, 2007

2006

A Formal Language Analysis of DNA Hairpin Structures.

Lila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin

Fundam. Informaticae, 2006

2005

Hairpin Structures in DNA Words.

Lila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosík, Gabriel Thierrin

Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

On Hairpin-Free Words and Languages.

Lila Kari, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2002

On the robustness of primitive words.

Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu

Discret. Appl. Math., 2002

Codes, Involutions, and DNA Encodings.

Lila Kari, Rob Kitto, Gabriel Thierrin

Proceedings of the Formal and Natural Computing, 2002

2001

Morphisms preserving densities.

Helmut Jürgensen, Lila Kari, Gabriel Thierrin

Int. J. Comput. Math., 2001

Tree-systems of morphisms.

Jürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu

Acta Informatica, 2001

Insertion of languages and differential semirings.

Gabriel Thierrin

Proceedings of the Where Mathematics, 2001

2000

Shuffle and scattered deletion closure of languages.

Masami Ito, Lila Kari, Gabriel Thierrin

Theor. Comput. Sci., 2000

1999

Multiset Processing by Means of Systems of Finite State Transducers.

Gheorghe Paun, Gabriel Thierrin

Proceedings of the Automata Implementation, 1999

1997

Insertion and Deletion Closure of Languages.

Masami Ito, Lila Kari, Gabriel Thierrin

Theor. Comput. Sci., 1997

Morphisms and Primitivity.

Gheorghe Paun, Gabriel Thierrin

Bull. EATCS, 1997

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

Proceedings of the DNA Based Computers, 1997

1996

Maximal and Minimal Solutions to Language Equations.

Lila Kari, Gabriel Thierrin

J. Comput. Syst. Sci., 1996

Omega-Syntactic Congruences.

Lila Kari, Gabriel Thierrin

J. Autom. Lang. Comb., 1996

Contextual Insertions/Deletions and Computability.

Lila Kari, Gabriel Thierrin

Inf. Comput., 1996

1995

Morphisms and Associated Congruences.

Lila Kari, Gabriel Thierrin

Proceedings of the Developments in Language Theory II, 1995

1994

Congruences, Infix and Cohesive Prefix Codes.

Masami Ito, Gabriel Thierrin

Theor. Comput. Sci., 1994

Monogenic e-closed languages and dipolar words.

Huei-Jan Shyr, S. S. Yu, Gabriel Thierrin

Discret. Math., 1994

Aperiodic Languages and Generalizations.

Lila Kari, Gabriel Thierrin

Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994

1992

Languages Whose n-Element Subsets Are Codes.

Masami Ito, Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin

Theor. Comput. Sci., 1992

1991

Outfix and Infix Codes and Related Classes of Languages.

Masami Ito, Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin

J. Comput. Syst. Sci., 1991

1989

Disjunctive Languages and Compatible Orders.

Masami Ito, Huei-Jan Shyr, Gabriel Thierrin

RAIRO Theor. Informatics Appl., 1989

Anti-commutative languages and n-codes.

Masami Ito, Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin

Discret. Appl. Math., 1989

1986

Disjunctive Decomposition of Languages.

Y. Q. Guo, G. W. Xu, Gabriel Thierrin

Theor. Comput. Sci., 1986

Which Monoids are Syntactic Monoids of omega-Languages?

Helmut Jürgensen, Gabriel Thierrin

J. Inf. Process. Cybern., 1986

1984

On Bounded Context-free Languages.

Michel Latteux, Gabriel Thierrin

J. Inf. Process. Cybern., 1984

1983

DOL Schemes and the Periodicity of String Embeddings.

Tom Head, Gabriel Thierrin, John Wilkinson

Theor. Comput. Sci., 1983

On<i>ω</i>-Languages whose syntactic monoid is trivial.

Helmut Jürgensen, Gabriel Thierrin

Int. J. Parallel Program., 1983

Disjunctive omega-Languages.

Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin

J. Inf. Process. Cybern., 1983

1981

H-Bounded and Semi-discrete Languages

M. Kunze, Huei-Jan Shyr, Gabriel Thierrin

Inf. Control., November, 1981

1980

Hypercodes in Deterministic and Slender 0L Languages

Tom Head, Gabriel Thierrin

Inf. Control., June, 1980

1979

Reflective Star Languages and Codes

C. M. Reis, Gabriel Thierrin

Inf. Control., July, 1979

Strong endomorphisms of automata.

Andre D. Paradis, Gabriel Thierrin

Proceedings of the Fundamentals of Computation Theory, 1979

1977

Codes, Languages and MOL Schemes.

Huei-Jan Shyr, Gabriel Thierrin

RAIRO Theor. Informatics Appl., 1977

Disjunctive Languages and Codes.

Huei-Jan Shyr, Gabriel Thierrin

Proceedings of the Fundamentals of Computation Theory, 1977

1975

Left-noncounting languages.

Huei-Jan Shyr, Gabriel Thierrin

Int. J. Parallel Program., 1975

Preorder Relations Associated with Developmental Systems and Languages.

Huei-Jan Shyr, Gabriel Thierrin

Proceedings of the Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31, 1975

1974

Hypercodes

Huei-Jan Shyr, Gabriel Thierrin

Inf. Control., January, 1974

Power-Separating Regular Languages.

Huei-Jan Shyr, Gabriel Thierrin

Math. Syst. Theory, 1974

1972

Convex Languages.

Gabriel Thierrin

Proceedings of the Automata, 1972

1970

Simple automata.

Gabriel Thierrin

Kybernetika, 1970

1968

Permutation Automata.

Gabriel Thierrin

Math. Syst. Theory, 1968