Monoids with disjunctive identity and their codes

[1]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[2]  Ronald V. Book,et al.  THUE SYSTEMS AND THE CHURCH-ROSSER PROPERTY: REPLACEMENT SYSTEMS, SPECIFICATION OF FORMAL LANGUAGES, AND PRESENTATIONS OF MONOIDS† , 1983 .

[3]  Semigroups with each element disjunctive , 1980 .

[4]  S. Adjan,et al.  Defining Relations and Algorithmic Problems for Groups and Semigroups , 1967 .

[5]  Christophe Reutenauer.  Biprefix Codes and Semisimple Algebras , 1982, ICALP.

[6]  G. Lallement.  Semigroups and combinatorial applications , 1979 .

[7]  Celia Wrathall,et al.  A Note on Representations of a Certain Monoid , 1982, Theor. Comput. Sci..

[8]  Y. Cochet,et al.  Une Generalisation des Ensembles de Dyck , 1971 .

[9]  Total disjunktive verallgemeinerte Bruck-Reilly-Erweiterungen von Halbgruppen und formale Sprachen , 1983 .

[10]  Ronald V. Book,et al.  Confluent and Other Types of Thue Systems , 1982, JACM.

[11]  Matthias Jantzen.  On a Special Monoid with a Single Defining Relation , 1981, Theor. Comput. Sci..

[12]  Huei-Jan Shyr,et al.  Codes, Languages and MOL Schemes , 1977, RAIRO Theor. Informatics Appl..

[13]  Huei-Jan Shyr.  Ordered Catenation and Regular Free Disjunctive Languages , 1980, Inf. Control..

[14]  J. Berstel,et al.  Theory of codes , 1985 .

[15]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[16]  H. Shyr.  Free monoids and languages , 1979 .

[17]  A remark concerning congruences on [0-]bisimple inverse semigroups , 1971 .

[18]  G. Thierrin,et al.  Hypercodes, right convex languages and their syntactic monoids , 1981 .