Gabriel Thierrin

According to our database1, Gabriel Thierrin
  • authored at least 42 papers between 1968 and 2007.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2007
The syntactic monoid of hairpin-free languages.
Acta Inf., 2007

2006
A Formal Language Analysis of DNA Hairpin Structures.
Fundam. Inform., 2006

2005
Hairpin Structures in DNA Words.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

On Hairpin-Free Words and Languages.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2002
On the robustness of primitive words.
Discrete Applied Mathematics, 2002

Codes, Involutions, and DNA Encodings.
Proceedings of the Formal and Natural Computing, 2002

2001
Morphisms preserving densities.
Int. J. Comput. Math., 2001

Tree-systems of morphisms.
Acta Inf., 2001

Insertion of languages and differential semirings.
Proceedings of the Where Mathematics, 2001

2000
Shuffle and scattered deletion closure of languages.
Theor. Comput. Sci., 2000

1999
Multiset Processing by Means of Systems of Finite State Transducers.
Proceedings of the Automata Implementation, 1999

1997
Insertion and Deletion Closure of Languages.
Theor. Comput. Sci., 1997

Morphisms and Primitivity.
Bulletin of the EATCS, 1997

At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems.
Proceedings of the DNA Based Computers, 1997

1996
Maximal and Minimal Solutions to Language Equations.
J. Comput. Syst. Sci., 1996

Omega-Syntactic Congruences.
Journal of Automata, Languages and Combinatorics, 1996

Contextual Insertions/Deletions and Computability.
Inf. Comput., 1996

1995
Morphisms and Associated Congruences.
Proceedings of the Developments in Language Theory II, 1995

1994
Congruences, Infix and Cohesive Prefix Codes.
Theor. Comput. Sci., 1994

Monogenic e-closed languages and dipolar words.
Discrete Mathematics, 1994

1992
Languages Whose n-Element Subsets Are Codes.
Theor. Comput. Sci., 1992

1991
Outfix and Infix Codes and Related Classes of Languages.
J. Comput. Syst. Sci., 1991

1989
Disjunctive Languages and Compatible Orders.
ITA, 1989

Anti-commutative languages and n-codes.
Discrete Applied Mathematics, 1989

1986
Disjunctive Decomposition of Languages.
Theor. Comput. Sci., 1986

Which Monoids are Syntactic Monoids of omega-Languages?
Elektronische Informationsverarbeitung und Kybernetik, 1986

1984
On Bounded Context-free Languages.
Elektronische Informationsverarbeitung und Kybernetik, 1984

1983
DOL Schemes and the Periodicity of String Embeddings.
Theor. Comput. Sci., 1983

Onω-Languages whose syntactic monoid is trivial.
International Journal of Parallel Programming, 1983

Disjunctive omega-Languages.
Elektronische Informationsverarbeitung und Kybernetik, 1983

1981
H-Bounded and Semi-discrete Languages
Information and Control, November, 1981

1980
Hypercodes in Deterministic and Slender 0L Languages
Information and Control, June, 1980

1979
Reflective Star Languages and Codes
Information and Control, July, 1979

Strong endomorphisms of automata.
FCT, 1979

1977
Codes, Languages and MOL Schemes.
ITA, 1977

Disjunctive Languages and Codes.
FCT, 1977

1975
Left-noncounting languages.
International Journal of Parallel Programming, 1975

1974
Hypercodes
Information and Control, January, 1974

Power-Separating Regular Languages.
Mathematical Systems Theory, 1974

1972
Convex Languages.
ICALP, 1972

1970
Simple automata.
Kybernetika, 1970

1968
Permutation Automata.
Mathematical Systems Theory, 1968


  Loading...