메뉴 건너뛰기




Volumn 4052 LNCS, Issue , 2006, Pages 504-515

Theories of HNN-extensions and amalgamated products

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; FINITE AUTOMATA; NEURAL NETWORKS; PROBLEM SOLVING;

EID: 33746354638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_43     Document Type: Conference Paper
Times cited : (23)

References (20)
  • 2
    • 26444550722 scopus 로고    scopus 로고
    • The existential theory of equations with rational constraints in free groups is PSPACE-complete
    • V. Diekert, C. Gutiérrez, and C. Hagenah. The existential theory of equations with rational constraints in free groups is PSPACE-complete. Inf. Comput., 202(2): 105-140, 2005.
    • (2005) Inf. Comput. , vol.202 , Issue.2 , pp. 105-140
    • Diekert, V.1    Gutiérrez, C.2    Hagenah, C.3
  • 3
    • 35248879684 scopus 로고    scopus 로고
    • Word equations over graph products
    • LNCS 2914, Springer
    • V. Diekert and M. Lohrey. Word equations over graph products. In Proc. FSTTCS 2003, LNCS 2914, pages 156-167. Springer, 2003.
    • (2003) Proc. FSTTCS 2003 , pp. 156-167
    • Diekert, V.1    Lohrey, M.2
  • 4
    • 1342333622 scopus 로고    scopus 로고
    • Existential and positive theories of equations in graph products
    • V. Diekert and M. Lohrey. Existential and positive theories of equations in graph products. Theory Comput. Syst., 37(1): 133-156, 2004.
    • (2004) Theory Comput. Syst. , vol.37 , Issue.1 , pp. 133-156
    • Diekert, V.1    Lohrey, M.2
  • 5
    • 33845949467 scopus 로고    scopus 로고
    • Solvability of equations in free partially commutative groups is decidable
    • to appear
    • V. Diekert and A. Muscholl. Solvability of equations in free partially commutative groups is decidable. Int. J. Algebra Comput., 2006. to appear.
    • (2006) Int. J. Algebra Comput.
    • Diekert, V.1    Muscholl, A.2
  • 6
    • 21844500110 scopus 로고
    • Undecidability of the positive ∀∃3-theory of a free semi-group
    • English translation
    • V. G. Durnev. Undecidability of the positive ∀∃3- theory of a free semi-group. Sibirsky Matematicheskie Jurnal, 36(5): 1067-1080, 1995. English translation.
    • (1995) Sibirsky Matematicheskie Jurnal , vol.36 , Issue.5 , pp. 1067-1080
    • Durnev, V.G.1
  • 9
    • 85009783356 scopus 로고    scopus 로고
    • Tarski's problem about the elementary theory of free groups has a positive solution
    • O. G. Kharlampovich and A. Myasnikov. Tarski's problem about the elementary theory of free groups has a positive solution. Electron. Res. Announc. AMS, 4(14): 101-108, 1998.
    • (1998) Electron. Res. Announc. AMS , vol.4 , Issue.14 , pp. 101-108
    • Kharlampovich, O.G.1    Myasnikov, A.2
  • 10
    • 0013365396 scopus 로고    scopus 로고
    • Makanin's algorithm is not primitive recursive
    • A. Koscielski and L. Pacholski. Makanin's algorithm is not primitive recursive. Theor. Comput. Sci., 191 (1-2): 145-156, 1998.
    • (1998) Theor. Comput. Sci. , vol.191 , Issue.1-2 , pp. 145-156
    • Koscielski, A.1    Pacholski, L.2
  • 15
    • 84956071098 scopus 로고
    • Equations in a free group
    • English translation
    • G. S. Makanin. Equations in a free group. Math. USSR, Izu, 21:483-546, 1983. English translation.
    • (1983) Math. USSR, Izu , vol.21 , pp. 483-546
    • Makanin, G.S.1
  • 16
    • 0002582196 scopus 로고
    • Decidability of the universal and positive theories of a free group
    • English translation
    • G. S. Makanin. Decidability of the universal and positive theories of a free group. Math. USSR, Izu, 25:75-88, 1985. English translation.
    • (1985) Math. USSR, Izu , vol.25 , pp. 75-88
    • Makanin, G.S.1
  • 17
    • 0038230637 scopus 로고
    • Positive formulas on free groups
    • In Russian
    • Y. I. Merzlyakov. Positive formulas on free groups. Algebra i Logika Sem., 5(4):25-42, 1966. In Russian.
    • (1966) Algebra i Logika Sem. , vol.5 , Issue.4 , pp. 25-42
    • Merzlyakov, Y.I.1
  • 18
    • 0001567182 scopus 로고
    • Groups, the theory of ends, and context-free languages
    • D. E. Muller and P. E. Schupp. Groups, the theory of ends, and context-free languages. J. Comput. Syst. Sci., 26:295-310, 1983.
    • (1983) J. Comput. Syst. Sci. , vol.26 , pp. 295-310
    • Muller, D.E.1    Schupp, P.E.2
  • 19
    • 4243105086 scopus 로고    scopus 로고
    • Satisfiability of word equations with constants is in PSPACE
    • W. Plandowski. Satisfiability of word equations with constants is in PSPACE. J. ACM, 51(3): 483-496, 2004.
    • (2004) J. ACM , vol.51 , Issue.3 , pp. 483-496
    • Plandowski, W.1
  • 20
    • 0001126708 scopus 로고
    • Canonical representatives and equations in hyperbolic groups
    • E. Rips and Z. Sela. Canonical representatives and equations in hyperbolic groups. Invent. Math., 120:489-512, 1995.
    • (1995) Invent. Math. , vol.120 , pp. 489-512
    • Rips, E.1    Sela, Z.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.