G. THIERRIN - LIST OF PUBLICATIONS

  1. Sur les répartitions imprimitives des i-uples et les groupes qui les engendrent. Thèse de Doctorat,Fribourg 1951 (Jouve Editeur,Paris).

  2. Contribution à la théorie des équivalences dans les demi-groupes. Thèse de Doctorat d'Etat,Université de Paris 1954.(Bulletin de la Société Mathématique de France,t.83, p.103-159,1955).

  3. Sur les groupes semi-abéliens.(Actes de la Société Helvétique des Sciences Naturelles 1951,p.86-87).

  4. Sur une condition nécessaire et suffisante pour qu'un semi-groupe soit un groupe.(Comptes Rendus de l'Académie des Sciences,Paris, t.232,p.376-378,1951).

  5. Sur les éléments inversifs et les éléments unitaires d'un demi-groupe inversif.(Comptes Rendus,t.232,p.33-34, 1952).

  6. Sur une classe de demi-groupes inversifs.(Comptes Rendus, t.234, p.177-179,1952).

  7. Sur une classe de transformations dans les demi-groupes inversifs. Comptes Rendus,t.234,p.1025-1017,1952).

  8. Sur les demi-groupes inversés.(Comptes Rendus,t.234, p.1336-1368, 1952).

  9. Sur les homogroupes.(Comptes Rendus,t.234, p.1519-1521, 1952).

  10. Sur les homodomaines et les homocorps.(Comptes Rendus, t.236, p.1595-1597,1953).

  11. Sur quelques classes de demigroupes.(Comptes Rendus, t.236, p.33-35,1953).

  12. Sur quelques équivalences dans les demi-groupes. (Comptes Rendus, t.236,p.565-567,1953).

  13. Quelques propriétés des équivalences réversibles généralisées dans un demi-groupe.(Comptes Rendus, t.236, p.1399-1401,1953).

  14. Sur une équivalence en relation avec l'équivalence réversible généralisée.(Comptes Rendus,t.236, p.1723-1725, 1953).

  15. Quelques propriétés des sous-groupoides consistants d'un demi-groupe abélien D.(Comptes Rendus,t.236, p.1837-1839, 1953).

  16. Sur la caractérisation des équivalences régulières dans les demi-groupes. (Académie Royale de Belgique, Bulletin de la Classe des Sciences, t.39, p.942-947, 1943).

  17. Sur quelques classes de demi-groupes possédant certaines propriétés des demi-groupes. (Comptes Rendus, t.238, p.1765-1767,1954).

  18. Sur la caractérisation des groupes par leurs équivalences régulières. (Comptes Rendus, t.238, p.1954-1956, 1954).

  19. Sur la caractérisations des groupes par leurs équivalences simpli fiables. (Comptes Rendus,t.238, p.2046-2048, 1954).

  20. Sur la caractérisation des groupes par certaines propriétés de leurs relations d'ordre. (Comptes Rendus, t.239, p.1453-1455, 1954).

  21. Sur quelques propriétés de certaines classes de demi-groupes. (Comptes Rendus, t.239, p.1335-1337,1954).

  22. Demi-groupes inversés et rectangulaires. (Académie Royale de Belgique, Bulletin de la Classe des Sciences, t.41, p.83-92, 1955).

  23. Sur une propriété caractéristique des demi-groupes inversés et rectangulaires. (Comptes Rendus, t.241, p.1192- 1194, 1955).

  24. Sur la théorie des demi-groupes. (Commentarii Mathematici Helvetici, t.30, p.211-223, 1956).

  25. Sur quelques décompositions des groupoides. (Comptes Rendus t.242, p.596-598, 1956).

  26. Sur les automorphismes intérieurs d'un demigroupe réductif . (Commentarii Mathematici Helvetici, t.31, p.145-151, 1956).

  27. Contribution à la théorie des anneaux et des demi-groupes.(Commen tarii Mathematici Helvetici, t.32, p.93-112, 1957).

  28. Sur la structure des demi-groupes. (Annales de l'Université d'Alger, t.3, p.161-171, 1956).

  29. Sur les idéaux complètement premiers d'un anneau quelconque. (Bulletin de la Classe des Sciences de l'Académie Royale de Belgique, t.43, p.124-132, 1957).

  30. Sur les idéaux fermatiens d'un anneau commutatif. (Commentarii Mathematici Helvetici, t.33, p.241-247, 1958).

  31. Sur le radical corpoidal d'un anneau. (Canadian J. of Mathematics, vol.12, p.101-106, 1960).

  32. Sur la structure d'une classe d'anneaux. (Canadian Mathematical Bulletin, vol.3, p.1-16, 1960).

  33. On duo rings. (Canadian Math. Bulletin, vol.3, p.167-172, 1960).

  34. Quelques problèmes concernant la structure des anneaux. (Séminaire d'Algèbre, Université de Paris, No.2,1959-60).

  35. Extensions radicales et quasi-radicales dans les anneaux. (Canadian Math. Bulletin, vol.5, p.29-35, 1962).

  36. Sur les anneaux partiellement ordonnés. (Canadian Math. Bulletin, vol.5, p.123-128,1962).

  37. Une caractérisation des groupes d'ordre premier. (Abstracts, International Congress of Mathematicians, Stockolm, 1962).

  38. Anneaux métaprimitifs. (Canadian J. of Mathematics, vol.17, p.199-205, 1965).

  39. Demi-groupes séparateurs. (Canadian Math. Bulletin, vol.9, p.611619, 1966).(With J.C.Derdérian).

  40. Quelques caractérisations du radical d'un anneau. (Canadian Math. Bulletin, vol.10, p.643-648, 1967).

  41. Permutation Automata. (Mathematical Systems Theory, vol.2, p.83-90, 1968).

  42. Décomposition des langages réguliers. (Revue d'Informatique et de Recherche Opérationnelle, No.r-3, p.45-50, 1969).

  43. Idéaux à droite minimaux d'un anneau primitif. (Canadian Math. Bulletin, vol.3, p.385-386, 1970).

  44. Simple Automata. (Kybernetika, vol.6, p.343-350, 1970).

  45. Irreducible Automata. (Proceedings of the Canadian Math. Congress, 1971, p.245-262).

  46. Idéaux à droite maximaux. (Acta Mathematica Acad. Sc. Hung., vol.23, p.321-323, 1971).

  47. s-reflexive semigroups and rings. (Canadian Math. Bulletin, vol.15, p.185-188, 1972). (With M.Chacron).

  48. Finitness conditions for finitely generated monoids. (Semigroup Forum,vol.3,p.252-254, 1972).

  49. On semigroups in which every Rees one-sided congruence is a congruence. (Semigroup Forum, vol.3, p.215-223, 1972). (With G.Baird).

  50. Decomposition of locally transitive semiautomata. (Utilitas Mathematica, vol.2, p.25-32, 1972).

  51. Convex languages. (Automata, Languages and Programming, IRIA Symposium, Paris 1972, North-Holland Publ.Company, p.481-492).

  52. The syntactic monoid of a hypercode. (Semigroup Forum, vol.6, p.227-231, 1973).

  53. Hypercodes. (Information and Control, vol.24, p.45-54, 1974). (With h.Shyr).

  54. Some conditions for the existence of an optimal solution of a linear program. (Canadian J. of Operational Research and Information Processing, vol.12, p.109-111, 1974).

  55. Power-separating regular languages. (Mathematical Systems Theory, vol.8, p.90-95, 1974).(With H.Shyr).

  56. Ordered automata and associated languages. (The Tamkang J. of Mathematics,vol.5, p.9-20, 1974). (With h.Shyr).

  57. Left noncounting languages. (International J. of Computer and Information Sciences, vol.4, p.95-102, 1975). (With H.Shyr).

  58. A mode of decomposition of regular languages. (Semigroup Forum, vol.10, p.32-38, 1975).

  59. An algebraic dependence over the quasi-centre. (Annali di Mathema- tica,vol.CX, p.1-14, 1976). (With M.Chacron).

  60. (n,k)-languages. (The Tamkang J. of Mathematics,vol.6, p.281-284, 1974). (With H.Shyr).

  61. Preorder relations associated with developmental systems and languages. (North-Holland Publ.Co.,p.301-311, 1976). (Editors: A.Lindenmayer and G.Rozenberg). (With H.Shyr).

  62. A characterization of the commutator subgroup of a group. (Canadian Math. Bulletin, vol.19, p.93-94, 1976).

  63. Regular prefix codes and right power-bounded languages. (Semigroup Forum, vol.13, p.77-83, 1976).

  64. Codes and binary relations. (Springer Lecture Notes in Mathematics, vol.586, p.180-188, 1977). (With H.Shyr).

  65. Right local semigroups. (J. of Algebra, vol..46, p.134-147, 1977). (With S.Rankin and C.Reis).

  66. p-independent languages. (The Tamkang J. Mathematics, vol.8, p.87-97, 1977). (With L.Y.Kuan).

  67. Disjunctive languages and codes. (Proceedings of the 1977 Interna- tional Conference, Fundamentals of Computation Theory, Poznam, Poland. Springer Lecture Notes in Computer Science, vol.56, p.171-176, 1977). (With H.Shyr).

  68. e-simple reflective semigroups. (Semigroup Forum, vol.14, p.283-294, 1977). (With G.Thomas).

  69. Codes,languages and MOL schemes. (R.A.I.R.O. Theoretical Computer Science, vol.11,p.293-301, 1977). (With H.Shyr).

  70. a-recognizable semigroups. (Proceedings Amer. Math. Soc.,vol.70, p.93-99, 1978). (With C.M.Reis and S.A.Rankin).

  71. On the reverse of a linear program. (Soochow J. of Mathematics, vol.4, p.1-5,1978).

  72. Reflective star languages and codes. (Information and Control, vol.42, p.1-9, 1979). (With C.M.Reis).

  73. Decomposition of some classes of subsets in a semigroup. (Pro- ceedings of the Conference on Semigroups 1979, Oberwolfach, Springer Lecture Notes in Mathematics, vol.855, p.182-188, 1981).

  74. Context-free and stationary languages. (International J. of Computer Mathematics, vol.7, p.297-301, 1979).

  75. Strong endomorphisms of connected automata. (Proceedings of the International Conference on Fundamentals of Computation Theory, Berlin 1979, Akademie Verlag, p.318-324, 1979). (With A.Paradis).

  76. Strong endomorphisms of p-connected automata. (Semigroup Forum, vol.20,p.91-93, 1980). (With A.Paradis).

  77. Right subdirectly irreducible semigroups. (Pacific J. Mathematics, vol.85, p.403-412, 1979). (With C.M.Reis and S.A.Rankin).

  78. Locally regular and locally finite languages. (The Tamkang J. of Mathematics, vol.10, p.253-262, 1979). (With H.Shyr).

  79. Locally nonconting languages. (Soochow J. Mathematics, vol.5, p.39-44, 1979). (With L.Y.Kuan).

  80. Hypercodes in deterministic and slender OL languages. (Information and Control, vol.45, p.251-262, 1980). (With T.Head).

  81. Semigroups with each element disjunctive. (Semigroup Forum, vol.21, p.127-141, 1980). (With H.Jurgensen).

  82. Rings with right disjunctive elements. (Simon Stevin Journal, vol.55, p.37-40, 1981).

  83. Hypercodes,right convex languages and syntactic monoids. (Proc. - Amer.Math.Soc.,vol.83, p.255-258, 1981).

  84. DOL schemes and the periodicity of string embedding. (J.of Theoretical Computer Science, vol.23,p.83-89, 1983). (With T.Head and J.Wilkinson).

  85. Primitive words and disjunctive languages. (Soochow J. of Mathema- tics, vol.7, p.155-163, 1981). (With H.Shyr).

  86. Languages of primitive words associated with set of natural integers. (Proceedings of the Conference on Semigroups and applica- tions,Oberwolfach 1981. Springer Lecture Notes in Mathematics, vol.998, p.404-411, 1983). (With A.Paradis).

  87. Quasi-disjunctive languages. (Soochow J. of Mathematics, vol.8, p.151-161, 1982). (With A.Paradis and H.Shyr).

  88. Maximal common subsequences of pairs of strings. (Proceedings of the Eleventh Annual Conference in Numerical Mathematics and Computing, Winnipeg 1981. Congressus Numerantium, vol.34, p.299-311, 1982). (With M.Kunze).

  89. Common subsequences and supersequences of finite sets of words. (Proceedings of the Conference on Combinatorics, Graph Theory and Computing, Boca Raton 1982. Congressus Numerantium, vol.36, p.221-234, 1982). (With M.Kunze).

  90. H-bounded and semi-discrete languages. (Information and Control, - vol.51,p.174-187, 1981). (With M.Kunze).

  91. Disjunctive w-languages. (Elektronische Informationsverarbeitung und Kybernetik, vol.19, p.267-278, 1983). (With H.Jurgensen and H.Shyr).

  92. Towards a general concept of hypercodes. (J. of Information and Optimization Sciences, vol. 4, p.255-268, 1983). (With H.Prodinger).

  93. Polynomially bounded DOL systems yield codes. (Combinatorics On Words: Progress and Perspectives, Academic Press 1983, p.167-174. Proceedings Conf.Comb.on Words,Waterloo 1982). (With T.Head)

  94. Semi-discrete context-free languages. (International J. of Computer Mathematics,vol.14, p.3-18, 1983 ). (With M.Latteux).

  95. On w-languages whose syntactic monoid is trivial. (International J. of Computer and Information Sciences,vol. 12, p.359-365, 1983 ). (With H.Jurgensen).

  96. On bounded context-free languages. (Elektronische Informationsver- arbeitung und Kybernetik, vol. 20, p.3-8, 1984). (With M.Latteux).

  97. Codes and commutative star languages. ( Soochow J. of Mathematics, vol.10, p.61-71, 1984). (With M.Latteux)

  98. Monoids with disjunctive identity and their codes. (Acta Mathema- tica, vol.47, p.299-312, 1986). ( with H.Jurgensen)

  99. Strict linear programs and tight matrices. ( J.Information and Optimization Science, vol.5, p.217-225, 1984).

  100. Some structural properties of w-languages. ( Proc. of the Conf. on Computer Science and Engineering, Varna 1984, 56-63, Sophia 1988). ( with H.Jurgensen).

  101. Varieties of monoids and classes of w-languages. (Proceedings of the Conference on theory and applications of semigroups, Greifswald(GDR), 1984, 62-67). (with H.Jurgensen).

  102. F-disjunctive languages. ( Intern.J. Computer Mathematics,vol. 18, 1986, 219-237). ( with Y.Guo and H.Shyr).

  103. QF-disjunctive languages. ( Papers on Automata Theory and Languages, vol.7, 1985, 1-28). ( with Y.Guo and H.Shyr).

  104. Codes and compatible partial orders on free monoids. (Proceedings of the International Symposium on Ordered Algebraic Structures(1984), Heldermann Verlag Berlin 1986, 323-333). ( with H.Jurgensen and H.Shyr).

  105. DOL schemes and recurrent words. ( The Book of L, Springer-Verlag, 1986, 157-166). ( with M.Ito).

  106. Infix codes. ( Proc. Fourth Hung. Computer Sc. Conf., Gyor 1985, 25-29). ( with H.Jurgensen).

  107. E-convex infix codes ( Order, vol. 3, 1986, 55-59). ( with Y.Guo and H.Shyr).

  108. Disjunctive decomposition of languages ( Theoretical Computer Science, vol. 46, 1986, 47-51). (with Y. Guo and G. Xu).

  109. Which monoids are syntactic monoids of w-languages? (J. of Information Processing and Cybernetics, vol. 22, 1986, 513-526). (with H.Jurgensen).

  110. Congruences associated with DOL-schemes (Proceedings Amer. Math. Soc., vol.102, 1988, 787-793). (with M.Petrich).

  111. Languages induced by certain homomorphisms of free monoids. (Proc. Conference on Semigroups, Oberwolfach 1986, Lecture Notes in Mathematics 1320, Springer-Verlag 1988, 260-280). (with M.Petrich).

  112. Characterizations of locally transitive semiautomata. (Papers on Automata Theory and Languages, vol. IX, 1987, 1-8). (with F.Gecseg).

  113. Semaphore codes and ideals. (J. Information and Optimization Science, vol. 9, 1988, 73-83). (with Y.Guo and S.H.Zhang).

  114. Disjunctive languages and compatibles partial orders. (Theoretical Informatics and Applications, vol. 23, 1989, 149-163). (with M.Ito and H.Shyr).

  115. Relatively f-disjunctive languages. (Semigroup Forum, vol.37, 1988, 289-299). (with Y.Guo and C.Reis).

  116. Anti-commutative languages and n-codes. (Discrete Applied Mathematics, vol.24, 1989, 187-196). (with M.Ito, H.Jurgensen and H.Shyr).

  117. A model of a five-dimensional universe. (Speculations in Science and Technology, vol.13, 1990, 101-111).

  118. n-prefix-suffix languages. (Intern. J. Computer Mathematics, vol.30, 1989, 37-56). (with M.Ito, H.Jurgensen and H.Shyr).

  119. The syntactic monoid of an infix code. (Proc. Amer. Math. Soc., vol.109, 1990, 865-873). (with M.Petrich).

  120. Outfix and infix codes and related classes of languages. (J. Computer and System Sciences, vol. 43, 1991, 484-508). (with M.Ito, H.Jurgensen, H.Shyr).

  121. Rho-discrete languages. (Proc. of the Conf. on Algebraic Theory of Codes and Related Topics, Kyoto, Japan 1989, RIMS Kokyuroku 697, 40-56). (with H. Shyr and S. Yu).

  122. Adherence in semigroups (Proc. of the 13th Symposium on Semigroups, Kyoto Univ., Japan 1989, 53-56). (with M. Ito and C. Reis).

  123. Skew-morphisms and systems (Lindenmayer Systems (Memorial Volume), Springer-Verlag 1992, 437-454). (with M. Ito).

  124. Languages whose n-elements subsets are codes (Theoretical Computer Science, vol. 30, p.325-344, 1992). (with M. Ito, H. Jurgensen, H. Shyr).

  125. Shuffle relations and codes (J. Information and Optimization Sciences, vol. 12, p. 441-449, 1991). (with S. Yu).

  126. Congruences on free monoids and generalizations of codes (Soochow J. of Mathematics , vol.18, p. 419-430, 1992). (with M. Petrich).

  127. Monogenic e-closed languages and dipolar words (Discrete Mathematics, vol. 126, 1994, 339-348). (with H. Shyr and S. Yu)

  128. Q-morphisms and QDOL systems (PU.M.A. Ser. A, vol.1, N0.3-4, 1990, 325-327). (with M. Ito).

  129. Right k-dense languages (Semigroup Forum, vol. 48, 1994, 313-325). (with M. Ito).

  130. Adherence in finitely generated free monoids (Congressus Numerantium, vol. 95, 1993, 37-45) (with C. Reis and M. Ito)

  131. Congruences, infix and cohesive prefix codes (Theoretical Computer Science, vol. 136, 1994, 471-486). (with M. Ito).

  132. Aperiodic languages and generalizations (Mathematical Aspects of Natural and Formal Languages, World Scientific, Singapore 1994, 233-243). (With Lila Kari).

  133. Languages and compatible relations on monoids (Mathematical linguistics and related topics. Editor G. Paun, Academiei Romane, Bucarest 1995,212-220). (With Lila Kari).

  134. Right shifting languages and their decompositions (Mathematical linguistics and related topics. Editor G. Paun, Academiei Romane, Bucarest 1995, 195-199). (With M.Ito).

  135. K-catenation and applications: k-prefix codes (J.Information and Optimization Sciences, Vol. 16, 1995, 263-276). (With Lila Kari).

  136. K-insertion and k-deletion closure of languages (Soochow J. Math., Vol 21, 1995, 479-4950. (With Lila Kari).

  137. Morphisms and associated congruences (Proceedings of the 2nd Intern Conf Developments in Language Theory, Magdeburg 1995/World Scientific, Singapore 1996, 119-128) (with Lila Kari)

  138. Languages and monoids with disjunctive identity (Collectanea Mathematica, Vol. 46, 1995, 97-107). (with Lila Kari).

  139. Omega-syntactic congruences (J. of Automata, Languages and Combinatorics, Vol. 1, 1996, 13-26) (with Lila Kari).

  140. Shuffle closed languages (Publicationes Mathematicae Debrecen, Vol. 48, 1996, 317-338). (with M. Ito and S. Yu).

  141. The syntactic monoid of the semigroup generated by a maximal prefix code (Proc. Amer. Math. Soc., Vol. 124, 1996, 655-663) (with M. Petrich and C. Reis)

  142. Contextual insertions/deletions and computability (Information and Computation, Vol. 131, 1966, 47-61) (with Lila Kari)

  143. Maximal and minimal solutions to languages equations (J. Computer and System Sciences, Vol. 53, 1996, 487-496) (with Lila Kari).

  144. Insertion and deletion closure of languages (Theoretical Computer Science, Vol. 183, 1997, 3-19) (with M. Ito and Lila Kari).

  145. Morphisms and primitivity (Bulletin of the EATCS, Vol. 61, 1997, 85-88) (With G. Paun)

  146. Word insertions and primitivity (Utilitas Mathematica, Vol. 53, 1998, 49-61) (With Lila Kari)

  147. Shuffle and scattered deletion closure of languages (Theoretical Computer Science, Vol. 245, 2000, 115-133) (with M. Ito and Lila Kari)

  148. At the crossroasd of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems (DIMACS Series in Discrete Math. & Comp. Sc., AMS, Vol. 48, 1999, 329-346) (With Lila Kari, G. Paun and S. Yu)

  149. Multiset processing by means of systems of finite state transducers (Workshop on Implementing Automata, Postdam 1999) (With G. Paun)

  150. Morphisms preserving densities (Intern. J. Computer Mathematics) (With H. Jurgensen and Lila Kari)

  151. On the robustness of primitive words (Discrete Applied Mathematics) (With G. Paun, N. Santean, G. Thierrin and S. Yu)

  152. Insertion of languages and differential semirings (C. Martin-Vide & V. Mitrana, eds., 2000: Where Mathematics, Computer Science, Linguistics and Biology Meet. Kluwer Academic 2001, 287-296)