| http://dbpedia.org/ontology/abstract
|
Dalam matematika, terutama di bidang aljab … Dalam matematika, terutama di bidang aljabar abstrak dikenal sebagai , masalah kata untuk G adalah masalah algoritmik untuk memutuskan apakah dua kata dalam generator mewakili elemen yang sama. Lebih tepatnya, jika A adalah himpunan terbatas untuk G maka kata uji coba adalah masalah keanggotaan untuk bahasa formal dari semua kata dalam A dan sekumpulan formal invers yang memetakan identitas di bawah peta alami dari monoid bebas. Jika B adalah himpunan penghasil hingga lain untuk G , maka masalah kata di himpunan pembangkit B setara dengan masalah kata di atas himpunan pembangkit A . Jadi seseorang dapat berbicara dengan jelas tentang desidabilitas dari masalah kata untuk grup G yang dihasilkan secara tak terbatas. Masalah kata seragam yang terkait tetapi berbeda untuk kelas K dari grup yang disajikan secara rekursif adalah masalah algoritmik dalam memutuskan, diberikan sebagai masukan presentasi P untuk grup G di kelas K dan dua kata di generator G , baik kata mewakili elemen yang sama dari G . Beberapa penulis mensyaratkan kelas K untuk didefinisikan oleh sekumpulan presentasi .didefinisikan oleh sekumpulan presentasi .
, In mathematics, especially in the area of … In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group G is the algorithmic problem of deciding whether two words in the generators represent the same element. More precisely, if A is a finite set of generators for G then the word problem is the membership problem for the formal language of all words in A and a formal set of inverses that map to the identity under the natural map from the free monoid with involution on A to the group G. If B is another finite generating set for G, then the word problem over the generating set B is equivalent to the word problem over the generating set A. Thus one can speak unambiguously of the decidability of the word problem for the finitely generated group G. The related but different uniform word problem for a class K of recursively presented groups is the algorithmic problem of deciding, given as input a presentation P for a group G in the class K and two words in the generators of G, whether the words represent the same element of G. Some authors require the class K to be definable by a recursively enumerable set of presentations.cursively enumerable set of presentations.
, Na álgebra abstrata, o problema da palavra … Na álgebra abstrata, o problema da palavra de um receptor recursivo na resolução de um algoritmo de nome grupo G, fornece um algoritmo de duas palavras para G, de forma que representem o mesmo elemento G. Apesar de ser dito popularmente como "Problema da palavra para grupos G" precisamente, ela é uma representação de um grupo que faz ou não faz soluções para esses tipos de problemas. Dadas duas representações finitas P e Q de um grupo G, P têm solução por meio do Problema da palavra para grupos caso Q apresente uma solução e/ou um valor diferente de uma incógnita. Neste caso não há nenhuma confusão em dizer problema da palavra para G (pois G representa quaisquer grandezas e/ou algoritmos inseridos em um conjunto). Quando um conjunto é recursivamente representado, mas não finitamente representado, as distinções se tornam importantes. A relatada (mas não definida) forma desconhecida da palavra para uma classe K recursivamente representa grupos nos problemas aritméticos, dados como uma representação de P de um conjunto G da classe K como duas palavras geradoras de G, como também as palavras também representam os mesmos elementos de G. Alguns problemas requerem a classe K para ser definida como uma "tabela recursiva enumerada de representações".la recursiva enumerada de representações".
, En mathématiques, plus précisément dans le … En mathématiques, plus précisément dans le domaine de la théorie combinatoire des groupes, le problème du mot pour un groupe de type fini G est le problème algorithmique de décider si deux mots en les générateurs du groupe représentent le même élément. Plus précisément, si X un ensemble fini de générateurs pour G, on considère le langage formel constitué des mots sur X et son ensemble d'inverses formels qui sont envoyés par l'application naturelle sur l'identité du groupe G. Le problème du mot est le problème algorithmique qui consiste à décider de l’appartenance ou non d'un mot à ce langage formel. On peut voir que si Y est un autre ensemble de générateurs pour G, alors le problème du mot avec l'ensemble Y est équivalent au problème du mot avec ensemble X. On peut donc parler sans ambiguïté de la décidabilité du problème du mot pour un groupe G de type fini. Un problème différent mais lié est le problème du mot uniforme pour une classe K de groupes donnés par un ensemble récursif de présentations ; le problème algorithmique est alors de décider, étant donné une présentation P d'un groupe G de la classe K, si deux mots représentent le même élément de G. On peut aussi considérer que la classe K est définissable seulement par un ensemble récursivement énumérable de présentations. Le problème du mot est indécidable dans le cas général, mais est décidable pour de nombreux groupes. Par exemple, les (en) ont un problème du mot décidable ; de même, l'algorithme de Todd-Coxeter et la complétion de Knuth-Bendix donnent des résultats effectifs. D'un autre côté, le fait qu'un algorithme particulier ne s'applique pas dans un cas particulier n'implique pas que le problème du mot est indécidable. Par exemple, l'algorithme de Dehn ne résout pas le problème du mot pour le groupe fondamental du tore, et pourtant ce groupe est le produit direct de deux groupes cycliques infinis et possède donc un problème du mot décidable.possède donc un problème du mot décidable.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://www.sciencedirect.com/bookseries/studies-in-logic-and-the-foundations-of-mathematics/vol/71/suppl/C +
, http://gdz.sub.uni-goettingen.de/index.php%3Fid=11&PPN=PPN235181684_0071&DMDID=DMDLOG_0013&L=1 +
, http://gdz.sub.uni-goettingen.de/index.php%3Fid=11&PPN=PPN235181684_0072&DMDID=DMDLOG_0039&L=1 +
, https://link.springer.com/chapter/10.1007/978-1-4613-9730-4_1 +
|
| http://dbpedia.org/ontology/wikiPageID
|
33563
|
| http://dbpedia.org/ontology/wikiPageLength
|
28208
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1114236709
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Category:Articles_with_example_pseudocode +
, http://dbpedia.org/resource/Empty_string +
, http://dbpedia.org/resource/Angus_Macintyre +
, http://dbpedia.org/resource/Algebraically_closed_group +
, http://dbpedia.org/resource/Free_abelian_group +
, http://dbpedia.org/resource/Polycyclic_group +
, http://dbpedia.org/resource/Fundamental_group +
, http://dbpedia.org/resource/Semigroup_Forum +
, http://dbpedia.org/resource/Euclidean_group +
, http://dbpedia.org/resource/Conjugacy_problem +
, http://dbpedia.org/resource/Category:Group_theory +
, http://dbpedia.org/resource/Free_group +
, http://dbpedia.org/resource/Rewriting +
, http://dbpedia.org/resource/Small_cancellation_theory +
, http://dbpedia.org/resource/Bernhard_Neumann +
, http://dbpedia.org/resource/SQ-universal_group +
, http://dbpedia.org/resource/Reachability_problem +
, http://dbpedia.org/resource/Nested_stack_automaton +
, http://dbpedia.org/resource/Normal_form_%28abstract_rewriting%29 +
, http://dbpedia.org/resource/Combinatorial_group_theory +
, http://dbpedia.org/resource/Absolute_presentation_of_a_group +
, http://dbpedia.org/resource/Mathematische_Annalen +
, http://dbpedia.org/resource/Mathematics +
, http://dbpedia.org/resource/Decision_problem +
, http://dbpedia.org/resource/Simple_group +
, http://dbpedia.org/resource/Mathematical_logic +
, http://dbpedia.org/resource/Identity_element +
, http://dbpedia.org/resource/Category:Articles_containing_proofs +
, http://dbpedia.org/resource/Braid_group +
, http://dbpedia.org/resource/Coxeter_group +
, http://dbpedia.org/resource/Max_Dehn +
, http://dbpedia.org/resource/Locally_finite_group +
, http://dbpedia.org/resource/London_Mathematical_Society +
, http://dbpedia.org/resource/Combinatorics_on_words +
, http://dbpedia.org/resource/Recursively_enumerable +
, http://dbpedia.org/resource/Finite_group +
, http://dbpedia.org/resource/Knuth%E2%80%93Bendix_completion_algorithm +
, http://dbpedia.org/resource/Undecidable_problem +
, http://dbpedia.org/resource/Todd%E2%80%93Coxeter_algorithm +
, http://dbpedia.org/resource/Category:Combinatorics_on_words +
, http://dbpedia.org/resource/Cyclic_group +
, http://dbpedia.org/resource/Partial_algorithm +
, http://dbpedia.org/resource/William_Boone_%28mathematician%29 +
, http://dbpedia.org/resource/Category:Undecidable_problems +
, http://dbpedia.org/resource/Presentation_of_a_group +
, http://dbpedia.org/resource/Word_problem_%28mathematics%29 +
, http://dbpedia.org/resource/Group_isomorphism_problem +
, http://dbpedia.org/resource/Canonical_form +
, http://dbpedia.org/resource/Generating_set_of_a_group +
, http://dbpedia.org/resource/Pyotr_Novikov +
, http://dbpedia.org/resource/Automatic_group +
, http://dbpedia.org/resource/Formal_language +
, http://dbpedia.org/resource/Residually_finite +
, http://dbpedia.org/resource/Literal_string +
, http://dbpedia.org/resource/Geometrically_finite_group +
, http://dbpedia.org/resource/Abstract_algebra +
, http://dbpedia.org/resource/Free_monoid_with_involution +
, http://dbpedia.org/resource/Springer-Verlag +
, http://dbpedia.org/resource/Finitely_generated_group +
, http://dbpedia.org/resource/Higman_embedding_theorem +
, http://dbpedia.org/resource/Boone-Higman_theorem +
, http://dbpedia.org/resource/Torus +
, http://dbpedia.org/resource/Negatively_curved_group +
, http://dbpedia.org/resource/Theory_of_algorithms +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:More_citations_needed_section +
, http://dbpedia.org/resource/Template:Sfn +
, http://dbpedia.org/resource/Template:Math +
, http://dbpedia.org/resource/Template:Tmath +
, http://dbpedia.org/resource/Template:Citation +
, http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Cite_book +
, http://dbpedia.org/resource/Template:Cite_journal +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Group_theory +
, http://dbpedia.org/resource/Category:Combinatorics_on_words +
, http://dbpedia.org/resource/Category:Undecidable_problems +
, http://dbpedia.org/resource/Category:Articles_containing_proofs +
, http://dbpedia.org/resource/Category:Articles_with_example_pseudocode +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Problem +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Word_problem_for_groups?oldid=1114236709&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Word_problem_for_groups +
|
| owl:sameAs |
http://id.dbpedia.org/resource/Masalah_kata_untuk_grup +
, http://yago-knowledge.org/resource/Word_problem_for_groups +
, http://pt.dbpedia.org/resource/Problema_da_palavra_para_grupos +
, http://dbpedia.org/resource/Word_problem_for_groups +
, https://global.dbpedia.org/id/4x6aW +
, http://fr.dbpedia.org/resource/Probl%C3%A8me_du_mot_pour_les_groupes +
, http://rdf.freebase.com/ns/m.083yc +
, http://www.wikidata.org/entity/Q8034369 +
|
| rdf:type |
http://dbpedia.org/ontology/Disease +
|
| rdfs:comment |
Na álgebra abstrata, o problema da palavra … Na álgebra abstrata, o problema da palavra de um receptor recursivo na resolução de um algoritmo de nome grupo G, fornece um algoritmo de duas palavras para G, de forma que representem o mesmo elemento G. Apesar de ser dito popularmente como "Problema da palavra para grupos G" precisamente, ela é uma representação de um grupo que faz ou não faz soluções para esses tipos de problemas. Dadas duas representações finitas P e Q de um grupo G, P têm solução por meio do Problema da palavra para grupos caso Q apresente uma solução e/ou um valor diferente de uma incógnita. Neste caso não há nenhuma confusão em dizer problema da palavra para G (pois G representa quaisquer grandezas e/ou algoritmos inseridos em um conjunto). Quando um conjunto é recursivamente representado, mas não finitamente represe representado, mas não finitamente repres
, Dalam matematika, terutama di bidang aljab … Dalam matematika, terutama di bidang aljabar abstrak dikenal sebagai , masalah kata untuk G adalah masalah algoritmik untuk memutuskan apakah dua kata dalam generator mewakili elemen yang sama. Lebih tepatnya, jika A adalah himpunan terbatas untuk G maka kata uji coba adalah masalah keanggotaan untuk bahasa formal dari semua kata dalam A dan sekumpulan formal invers yang memetakan identitas di bawah peta alami dari monoid bebas. Jika B adalah himpunan penghasil hingga lain untuk G , maka masalah kata di himpunan pembangkit B setara dengan masalah kata di atas himpunan pembangkit A . Jadi seseorang dapat berbicara dengan jelas tentang desidabilitas dari masalah kata untuk grup G yang dihasilkan secara tak terbatas.rup G yang dihasilkan secara tak terbatas.
, En mathématiques, plus précisément dans le domaine de la théorie combinatoire des groupes, le problème du mot pour un groupe de type fini G est le problème algorithmique de décider si deux mots en les générateurs du groupe représentent le même élément.
, In mathematics, especially in the area of … In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group G is the algorithmic problem of deciding whether two words in the generators represent the same element. More precisely, if A is a finite set of generators for G then the word problem is the membership problem for the formal language of all words in A and a formal set of inverses that map to the identity under the natural map from the free monoid with involution on A to the group G. If B is another finite generating set for G, then the word problem over the generating set B is equivalent to the word problem over the generating set A. Thus one can speak unambiguously of the decidability of the word problem for the finitely generated group G.roblem for the finitely generated group G.
|
| rdfs:label |
Masalah kata untuk grup
, Problema da palavra para grupos
, Word problem for groups
, Problème du mot pour les groupes
|
