LEADER 04292nam 2200613 450 001 9910480420103321 005 20180327181822.0 010 $a0-8218-7968-5 010 $a0-8218-3618-8 035 $a(CKB)3240000000069904 035 $a(EBL)3113313 035 $a(SSID)ssj0000629330 035 $a(PQKBManifestationID)11433178 035 $a(PQKBTitleCode)TC0000629330 035 $a(PQKBWorkID)10718452 035 $a(PQKB)11075564 035 $a(MiAaPQ)EBC3113313 035 $a(PPN)197107052 035 $a(EXLCZ)993240000000069904 100 $a20050214h20052005 uy| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aGroups, languages, algorithms $eAMS-ASL Joint Special Session on Interactions between Logic, Group Theory, and Computer Science, January 16-19, 2003, Baltimore, Maryland /$fAlexandre V. Borovik, editor 210 1$aProvidence, Rhode Island :$cAmerican Mathematical Society,$d[2005] 210 4$dİ2005 215 $a1 online resource (360 p.) 225 1 $aContemporary mathematics,$x0271-4132 ;$v378 300 $aDescription based upon print version of record. 320 $aIncludes bibliographical references. 327 $a""Contents""; ""Preface""; ""Formal languages and their application to combinatorial group theory""; ""1. Introduction""; ""2. Notation and definitions""; ""3. Regular languages""; ""4. Rational sets""; ""5. Context free languages""; ""7. Other language classes""; ""References""; ""Regular free length functions on Lyndon's free Z[t]-group FZ[t]""; ""1. Introduction""; ""2. Preliminaries""; ""3. A-words""; ""4. A free Lyndon length function on CDR(A, X)""; ""5. Lyndon's Exponentiation""; ""6. Extensions of centralizers""; ""7. Embedding of Fz[t] into CDR(Z[t], X)"" 327 $a""8. Algorithmic problems for FZ[t]""""References""; ""A-free groups and tree-free groups""; ""Effective JSJ decompositions""; ""Introduction""; ""1. Preliminaries""; ""2. Splittings""; ""3. Algorithms over fully residually free groups""; ""4. Generalized equations over free groups""; ""5. Elimination process: construction of T(a???)""; ""6. Elimination process: periodic structures""; ""7. Elimination process: splittings of coordinate groups""; ""8. Structure of solutions, the solution tree Tsol(a???, A)""; ""9. Maximal standard quotients and canonical embeddings of F-groups"" 327 $a""10. Effective free decompositions""""11. Homomorphisms of finitely generated groups into fully residually free groups""; ""12. Free Lyndon length functions on NTQ groups.""; ""13. Effective construction of JSJ decompositions of groups from F.""; ""14. Homomorphisms into NTQ groups""; ""15. Some applications to equations in F-groups""; ""References""; ""Algebraic geometry over free groups: Lifting solutions into generic points""; ""Introduction""; ""1. Scheme of the proof""; ""2. Elementary properties of liftings""; ""3. Cut equations"" 327 $a""4. Basic automorphisms of orientable quadratic equations""""5. Generic solutions of orientable quadratic equations""; ""6. Small cancellation solutions of standard orientable equations""; ""7. Implicit function theorem for quadratic equations""; ""8. Implicit function theorem for NTQ systems""; ""9. Groups that are elementary equivalent to a free group""; ""References""; ""Divisibility theory and complexity of algorithms for free partially commutative groups""; ""1. Introduction""; ""2. Free partially commutative groups""; ""3. Divisibility Theory"" 327 $a""4. Normal forms arising from H N N extensions""""5. Conjugacy problem""; ""6. Complexity of algorithms: some estimates""; ""References"" 410 0$aContemporary mathematics (American Mathematical Society) ;$vv. 378. 606 $aGroup theory$vCongresses 606 $aFinite groups$vCongresses 606 $aInfinite groups$vCongresses 608 $aElectronic books. 615 0$aGroup theory 615 0$aFinite groups 615 0$aInfinite groups 676 $a512/.2 702 $aBorovik$b Alexandre V. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910480420103321 996 $aGroups, languages, algorithms$92122836 997 $aUNINA