default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGabriel Thierrin
Person information
- affiliation: University of Western Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j32]Lila Kari, Kalpana Mahalingam
, Gabriel Thierrin:
The syntactic monoid of hairpin-free languages. Acta Informatica 44(3-4): 153-166 (2007)- 2006
- [j31]Lila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin:
A Formal Language Analysis of DNA Hairpin Structures. Fundam. Informaticae 71(4): 453-475 (2006) - 2005
- [c11]Lila Kari, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin:
On Hairpin-Free Words and Languages. Developments in Language Theory 2005: 296-307 - [c10]Lila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosík, Gabriel Thierrin:
Hairpin Structures in DNA Words. DNA 2005: 158-170 - 2002
- [j30]Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu:
On the robustness of primitive words. Discret. Appl. Math. 117(1-3): 239-252 (2002) - [c9]Lila Kari, Rob Kitto, Gabriel Thierrin:
Codes, Involutions, and DNA Encodings. Formal and Natural Computing 2002: 376-393 - 2001
- [j29]Jürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu:
Tree-systems of morphisms. Acta Informatica 38(2): 131-153 (2001) - [j28]Helmut Jürgensen, Lila Kari, Gabriel Thierrin:
Morphisms preserving densities. Int. J. Comput. Math. 78(2): 65-189 (2001) - [c8]Gabriel Thierrin:
Insertion of languages and differential semirings. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 287-296 - 2000
- [j27]Masami Ito, Lila Kari, Gabriel Thierrin:
Shuffle and scattered deletion closure of languages. Theor. Comput. Sci. 245(1): 115-133 (2000)
1990 – 1999
- 1999
- [c7]Gheorghe Paun, Gabriel Thierrin:
Multiset Processing by Means of Systems of Finite State Transducers. WIA 1999: 140-157 - 1997
- [j26]Gheorghe Paun, Gabriel Thierrin:
Morphisms and Primitivity. Bull. EATCS 61 (1997) - [j25]Masami Ito, Lila Kari, Gabriel Thierrin:
Insertion and Deletion Closure of Languages. Theor. Comput. Sci. 183(1): 3-19 (1997) - [c6]Lila Kari, Gheorghe Paun, Gabriel Thierrin, Sheng Yu:
At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems. DNA Based Computers 1997: 329-346 - 1996
- [j24]Lila Kari, Gabriel Thierrin:
Contextual Insertions/Deletions and Computability. Inf. Comput. 131(1): 47-61 (1996) - [j23]Lila Kari, Gabriel Thierrin:
Omega-Syntactic Congruences. J. Autom. Lang. Comb. 1(1): 13-26 (1996) - [j22]Lila Kari, Gabriel Thierrin:
Maximal and Minimal Solutions to Language Equations. J. Comput. Syst. Sci. 53(3): 487-496 (1996) - 1995
- [c5]Lila Kari, Gabriel Thierrin:
Morphisms and Associated Congruences. Developments in Language Theory 1995: 119-128 - 1994
- [j21]Huei-Jan Shyr, S. S. Yu, Gabriel Thierrin:
Monogenic e-closed languages and dipolar words. Discret. Math. 126(1-3): 339-348 (1994) - [j20]Masami Ito, Gabriel Thierrin:
Congruences, Infix and Cohesive Prefix Codes. Theor. Comput. Sci. 136(2): 471-485 (1994) - [p1]Lila Kari, Gabriel Thierrin:
Aperiodic Languages and Generalizations. Mathematical Aspects of Natural and Formal Languages 1994: 233-243 - 1992
- [j19]Masami Ito, Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin:
Languages Whose n-Element Subsets Are Codes. Theor. Comput. Sci. 96(2): 325-344 (1992) - 1991
- [j18]Masami Ito, Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin:
Outfix and Infix Codes and Related Classes of Languages. J. Comput. Syst. Sci. 43(3): 484-508 (1991)
1980 – 1989
- 1989
- [j17]Masami Ito, Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin:
Anti-commutative languages and n-codes. Discret. Appl. Math. 24(1-3): 187-196 (1989) - [j16]Masami Ito, Huei-Jan Shyr, Gabriel Thierrin:
Disjunctive Languages and Compatible Orders. RAIRO Theor. Informatics Appl. 23(2): 149-163 (1989) - 1986
- [j15]Helmut Jürgensen, Gabriel Thierrin:
Which Monoids are Syntactic Monoids of omega-Languages? J. Inf. Process. Cybern. 22(10/11): 513-526 (1986) - [j14]Y. Q. Guo, G. W. Xu, Gabriel Thierrin:
Disjunctive Decomposition of Languages. Theor. Comput. Sci. 46(3): 47-51 (1986) - 1984
- [j13]Michel Latteux, Gabriel Thierrin:
On Bounded Context-free Languages. J. Inf. Process. Cybern. 20(1): 3-8 (1984) - 1983
- [j12]Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin:
Disjunctive omega-Languages. J. Inf. Process. Cybern. 19(6): 267-278 (1983) - [j11]Helmut Jürgensen, Gabriel Thierrin:
Onω-Languages whose syntactic monoid is trivial. Int. J. Parallel Program. 12(5): 359-365 (1983) - [j10]Tom Head, Gabriel Thierrin, John Wilkinson:
DOL Schemes and the Periodicity of String Embeddings. Theor. Comput. Sci. 23: 83-89 (1983) - 1981
- [j9]M. Kunze, Huei-Jan Shyr, Gabriel Thierrin:
H-Bounded and Semi-discrete Languages. Inf. Control. 51(2): 174-187 (1981) - 1980
- [j8]Tom Head, Gabriel Thierrin:
Hypercodes in Deterministic and Slender 0L Languages. Inf. Control. 45(3): 251-262 (1980)
1970 – 1979
- 1979
- [j7]C. M. Reis, Gabriel Thierrin:
Reflective Star Languages and Codes. Inf. Control. 42(1): 1-9 (1979) - [c4]Andre D. Paradis, Gabriel Thierrin:
Strong endomorphisms of automata. FCT 1979: 318-324 - 1977
- [j6]Huei-Jan Shyr, Gabriel Thierrin:
Codes, Languages and MOL Schemes. RAIRO Theor. Informatics Appl. 11(4): 293-301 (1977) - [c3]Huei-Jan Shyr, Gabriel Thierrin:
Disjunctive Languages and Codes. FCT 1977: 171-176 - 1975
- [j5]Huei-Jan Shyr, Gabriel Thierrin:
Left-noncounting languages. Int. J. Parallel Program. 4(1): 95-102 (1975) - [c2]Huei-Jan Shyr, Gabriel Thierrin:
Preorder Relations Associated with Developmental Systems and Languages. Automata, Languages, Development 1975: 301-311 - 1974
- [j4]Huei-Jan Shyr, Gabriel Thierrin:
Hypercodes. Inf. Control. 24(1): 45-54 (1974) - [j3]Huei-Jan Shyr, Gabriel Thierrin:
Power-Separating Regular Languages. Math. Syst. Theory 8(1): 90-95 (1974) - 1972
- [c1]Gabriel Thierrin:
Convex Languages. ICALP 1972: 481-492 - 1970
- [j2]Gabriel Thierrin:
Simple automata. Kybernetika 6(5): 343-350 (1970)
1960 – 1969
- 1968
- [j1]Gabriel Thierrin:
Permutation Automata. Math. Syst. Theory 2(1): 83-90 (1968)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
