Author:
Jürgensen H.,Shyr H. J.,Thierrin G.
Publisher
Springer Science and Business Media LLC
Reference21 articles.
1. S. I. Adjan, Defining relations and algorithmic problems for groups and semigroups,Proc. Steklov Inst. of Mathematics 85 (1966). English Translation by American Mathematical Society (Providence, Rh. I., 1967).
2. J. Berstel, D. Perrin,Theory of codes, Academic Press (Orlando, 1985).
3. R. V. Book, Confluent and other types of Thue systems,J. ACM,29 (1982), 171–182.
4. R. Book, Thue systems and the Church—Rosser property: Replacement systems, specification of formal languages and presentations of monoids. 1–38 in: L. J. Cummings (editor),Combinatorics on words. Academic Press (Toronto, 1983).
5. A. H. Clifford, G. B. Preston,The algebraic theory of semigroups 2 vols. American Math. Soc. (Providence, Rh. I., 1961, 1967).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Insertion and deletion closure of languages;Theoretical Computer Science;1997-08
2. Visual Models of Plant Development;Handbook of Formal Languages;1997
3. Subapical bracketed L-systems;Lecture Notes in Computer Science;1996
4. Monogenic e-closed languages and dipolar words;Discrete Mathematics;1994-03
5. Syntactic monoids in the construction of systolic tree automata;International Journal of Computer & Information Sciences;1985-02