×

zbMATH — the first resource for mathematics

Logical aspects of Cayley-graphs: the monoid case. (English) Zbl 1151.03003

MSC:
03B25 Decidability of theories and sets of sentences
03D05 Automata and formal grammars in connection with logical questions
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
20M05 Free semigroups, generators and relations, word problems
PDF BibTeX Cite
Full Text: DOI
References:
[1] L. Babai, Handbook of Combinatorics 2, eds. R. L. Graham, M. Grötschel and L. Lovász (Elsevier Science Publishers, 1995) pp. 1447–1540.
[2] DOI: 10.1016/0304-3975(80)90037-7 · Zbl 0475.03017
[3] DOI: 10.1145/322290.322301 · Zbl 0478.68032
[4] DOI: 10.1007/978-1-4613-9771-7
[5] DOI: 10.1016/S0304-3975(99)00151-6 · Zbl 0987.20033
[6] Cartier P., Lecture Notes in Mathematics, No. 85, in: Problèmes Combinatoires de Commutation et Réarrangements (1969) · Zbl 0186.30101
[7] DOI: 10.1016/0168-0072(90)90080-L · Zbl 0705.03017
[8] DOI: 10.1142/9789814261456
[9] Feferman S., Fund. Math. 47 pp 57–
[10] Ferrante J., Lecture Notes in Mathematics, No. 718, in: The Computational Complexity of Logical Theories (1979)
[11] H. Gaifman, Logic Colloquium ’81, ed. J. Stern (North Holland, 1982) pp. 105–135.
[12] D. Giammarresi and A. Restivo, Handbook of Formal Languages 3, eds. G. Rozenberg and A. Salomaa (Springer, 1997) pp. 216–267.
[13] DOI: 10.1006/jabr.1995.1010 · Zbl 0831.20032
[14] DOI: 10.1017/CBO9780511551574
[15] Kelarev A. V., Australas. J. Combin. 25 pp 73–
[16] DOI: 10.1016/S0195-6698(02)00120-8 · Zbl 1011.05027
[17] DOI: 10.1007/s002330010162 · Zbl 1016.20047
[18] Knapik T., Fund. Inform. 39 pp 305–
[19] DOI: 10.1016/j.apal.2004.06.002 · Zbl 1063.03005
[20] DOI: 10.1142/S0129054105003248 · Zbl 1146.20314
[21] DOI: 10.1142/S021819670200122X · Zbl 1044.20024
[22] DOI: 10.1007/978-3-642-61896-3
[23] Magnus W., Combinatorial Group Theory (1966)
[24] Makanin G. S., Mat. Sb. 103 pp 147–
[25] Makanin G. S., Izv. Akad. Nauk SSR 46 pp 1199–
[26] DOI: 10.1016/0022-0000(83)90003-X · Zbl 0537.20011
[27] DOI: 10.1016/0304-3975(85)90087-8 · Zbl 0605.03005
[28] DOI: 10.1016/0020-0190(88)90049-X · Zbl 0653.03026
[29] DOI: 10.2307/1968867 · Zbl 0060.12501
[30] Ochmański E., Bull. Eur. Assoc. Theor. Comput. Sci. (EATCS) 27 pp 56–
[31] Papadimitriou C. H., Computational Complexity (1994) · Zbl 0833.68049
[32] DOI: 10.1007/BF03028235 · Zbl 0419.20024
[33] DOI: 10.2307/1971037 · Zbl 0345.02034
[34] DOI: 10.1093/qmath/hah006
[35] DOI: 10.1016/S0304-3975(01)00390-5 · Zbl 1061.20048
[36] Trakhtenbrot B. A., Amer. Math. Soc. Transl. Ser. II 23 pp 1– · Zbl 0121.01507
[37] DOI: 10.1007/s002330010075 · Zbl 0992.20042
[38] DOI: 10.1051/ita:2001103 · Zbl 1019.20028
[39] DOI: 10.1016/S0304-3975(01)00185-2 · Zbl 1026.68087
[40] Zelinka B., Casopis. Pest. Mat. 27 pp 407–
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.