Gabriel Thierrin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 44 from 44

2007

The syntactic monoid of hairpin-free languagesLila Kari, Kalpana Mahalingam, Gabriel Thierrin. ACTA, 44(3-4):153-166, 2007. [doi]

2006

A Formal Language Analysis of DNA Hairpin StructuresLila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin. FUIN, 71(4):453-475, 2006. [doi]

2005

Hairpin Structures in DNA WordsLila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosík, Gabriel Thierrin. dna 2006: 158-170 [doi]

On Hairpin-Free Words and LanguagesLila Kari, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin. dlt 2005: 296-307 [doi]

2002

Codes, Involutions, and DNA EncodingsLila Kari, Rob Kitto, Gabriel Thierrin. BIRTHDAY 2002: 376-393 [doi]

On the robustness of primitive wordsGheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu. DAM, 117(1-3):239-252, 2002.

2001

Tree-systems of morphismsJürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu. ACTA, 38(2):131-153, 2001. [doi]

Morphisms preserving densitiesHelmut Jürgensen, Lila Kari, Gabriel Thierrin. ijcm, 78(2):65-189, 2001. [doi]

Insertion of languages and differential semiringsGabriel Thierrin. BIRTHDAY 2001: 287-296

2000

Shuffle and scattered deletion closure of languagesMasami Ito, Lila Kari, Gabriel Thierrin. TCS, 245(1):115-133, 2000. [doi]

1999

Multiset Processing by Means of Systems of Finite State TransducersGheorghe Paun, Gabriel Thierrin. wia 2001: 140-157 [doi]

1997

Insertion and Deletion Closure of LanguagesMasami Ito, Lila Kari, Gabriel Thierrin. TCS, 183(1):3-19, 1997. [doi]

At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systemsLila Kari, Gheorghe Paun, Gabriel Thierrin, Sheng Yu. dimacs 1999: 329-346

Morphisms and PrimitivityGheorghe Paun, Gabriel Thierrin. eatcs, 61, 1997.

1996

Maximal and Minimal Solutions to Language EquationsLila Kari, Gabriel Thierrin. jcss, 53(3):487-496, 1996.

Contextual Insertions/Deletions and ComputabilityLila Kari, Gabriel Thierrin. iandc, 131(1):47-61, 1996.

Omega-Syntactic CongruencesLila Kari, Gabriel Thierrin. jalc, 1(1):13-26, 1996.

1995

Morphisms and Associated CongruencesLila Kari, Gabriel Thierrin. dlt 1995: 119-128

1994

Congruences, Infix and Cohesive Prefix CodesMasami Ito, Gabriel Thierrin. TCS, 136(2):471-485, 1994.

Aperiodic Languages and GeneralizationsLila Kari, Gabriel Thierrin. In Gheorghe Paun, editor, Mathematical Aspects of Natural and Formal Languages. Volume 43 of World scientific series in computer science, pages 233-243, World Scientific, 1994. [doi]

Monogenic e-closed languages and dipolar wordsHuei-Jan Shyr, S. S. Yu, Gabriel Thierrin. DM, 126(1-3):339-348, 1994. [doi]

1992

Languages Whose n-Element Subsets Are CodesMasami Ito, Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin. TCS, 96(2):325-344, 1992.

1991

Outfix and Infix Codes and Related Classes of LanguagesMasami Ito, Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin. jcss, 43(3):484-508, 1991.

1989

Anti-commutative languages and n-codesMasami Ito, Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin. DAM, 24(1-3):187-196, 1989. [doi]

Disjunctive Languages and Compatible OrdersMasami Ito, Huei-Jan Shyr, Gabriel Thierrin. ita, 23(2):149-163, 1989.

1986

Disjunctive Decomposition of LanguagesY. Q. Guo, G. W. Xu, Gabriel Thierrin. TCS, 46(3):47-51, 1986.

Which Monoids are Syntactic Monoids of omega-Languages?Helmut Jürgensen, Gabriel Thierrin. eik, 22(10/11):513-526, 1986.

1984

On Bounded Context-free LanguagesMichel Latteux, Gabriel Thierrin. eik, 20(1):3-8, 1984.

1983

DOL Schemes and the Periodicity of String EmbeddingsTom Head, Gabriel Thierrin, John Wilkinson. TCS, 23:83-89, 1983.

Disjunctive omega-LanguagesHelmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin. eik, 19(6):267-278, 1983.

ω-Languages whose syntactic monoid is trivialHelmut Jürgensen, Gabriel Thierrin. ijpp, 12(5):359-365, 1983. [doi]

1981

H-Bounded and Semi-discrete LanguagesM. Kunze, Huei-Jan Shyr, Gabriel Thierrin. iandc, 51(2):174-187, November 1981.

1980

Hypercodes in Deterministic and Slender 0L LanguagesTom Head, Gabriel Thierrin. iandc, 45(3):251-262, June 1980.

1979

Strong endomorphisms of automataAndre D. Paradis, Gabriel Thierrin. fct 1979: 318-324

Reflective Star Languages and CodesC. M. Reis, Gabriel Thierrin. iandc, 42(1):1-9, July 1979.

1977

Codes, Languages and MOL SchemesHuei-Jan Shyr, Gabriel Thierrin. ita, 11(4):293-301, 1977.

Disjunctive Languages and CodesHuei-Jan Shyr, Gabriel Thierrin. fct 1977: 171-176

1975

Left-noncounting languagesHuei-Jan Shyr, Gabriel Thierrin. ijpp, 4(1):95-102, 1975. [doi]

Preorder Relations Associated with Developmental Systems and LanguagesHuei-Jan Shyr, Gabriel Thierrin. Lsystems 1976: 301-311

1974

HypercodesHuei-Jan Shyr, Gabriel Thierrin. iandc, 24(1):45-54, January 1974.

Power-Separating Regular LanguagesHuei-Jan Shyr, Gabriel Thierrin. mst, 8(1):90-95, 1974.

1972

Convex LanguagesGabriel Thierrin. icalp 1972: 481-492

1970

Simple automataGabriel Thierrin. kybernetika, 6(5):343-350, 1970. [doi]

1968

Permutation AutomataGabriel Thierrin. mst, 2(1):83-90, 1968.

Sign in or sign up to see more results.

runs on WebDSL