This HTML5 document contains 130 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n4http://dbpedia.org/resource/File:
n18https://global.dbpedia.org/id/
dbpedia-hehttp://he.dbpedia.org/resource/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
dbpedia-pthttp://pt.dbpedia.org/resource/
dbpedia-cshttp://cs.dbpedia.org/resource/
n10http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
dbpedia-zhhttp://zh.dbpedia.org/resource/
n26https://archive.org/details/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbpedia-idhttp://id.dbpedia.org/resource/
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Free_monoid
rdf:type
yago:WikicatFreeAlgebraicStructures yago:Whole100003553 yago:Object100002684 yago:Artifact100021939 yago:PhysicalEntity100001930 yago:Structure104341686 yago:YagoGeoEntity yago:YagoPermanentlyLocatedEntity
rdfs:label
Volný monoid Monoide livre Monoid bebas 自由么半群 Free monoid
rdfs:comment
Em álgebra abstrata, o monoide livre sobre um conjunto A é o monoide cujos elementos são todas as strings (ou sequências de caracteres) finitas formadas por zero ou mais elementos de A. Ele é normalmente denotado por A∗. O elemento de identidade é a única sequência com zero elementos, muitas vezes chamada de string vazia e denotada por ε ou λ, e a operação do monoide é a concatenação de strings. O semigrupo livre em A é o subsemigrupo de A∗ contendo todos os elementos exceto a string vazia. Ele é denotado geralmente por A+. Volný monoid na množině je v abstraktní algebře monoid, jehož prvky jsou všechny konečné posloupnosti (neboli řetězce) prvků této množiny, přičemž monoidovou operací je operace zřetězení a neutrální prvek tvořený posloupností nula prvků se nazývá prázdný řetězec, a označuje se obvykle ε nebo λ. Volný monoid nad množinou A se obvykle označuje A∗; volná pologrupa na A je podpologrupa A∗ obsahující všechny prvky kromě prázdného řetězce; obvykle se označuje A+. 在抽象代數裡，於一集合A上的自由幺半群是指一幺半群，其元素都是由A內零個或多個元素以串接之二元運算形成的有限序列(或字符串)。通常標記為A*。其單位元為空字元串，標記為ε 或 λ。在A上的自由半群則指是A*內的子半群，其包含除了空字串外的所有元素。通常標記為A+。 更一般地，一抽象幺半群(半群)S被稱做是自由的，若其與某一集合上的自由幺半群(半群)同構。 如其名稱所述，自由幺半群(半群)為滿足定義了自由对象的泛性質的物件，在幺半群(半群)的範疇裡。它允許每一個么半群(半群)都會是某一自由幺半群(半群)的同態映像。研究半群為自由半群的映像的學科稱做。 Dalam aljabar abstrak, monoid bebas pada himpunan adalah monoid yang semua elemennya adalah (atau string) dari nol atau lebih elemen dari himpunan, dengan sebagai operasi monoid dan dengan urutan unik elemen nol, sering disebut dan dilambangkan dengan ε atau λ, sebagai elemen identitas. Monoid bebas pada himpunan A biasanya dilambangkan A∗. Semigrup bebas di A adalah subsemigrup dari A∗ mengandung semua elemen kecuali string kosong. Biasanya dilambangkan A+. In abstract algebra, the free monoid on a set is the monoid whose elements are all the finite sequences (or strings) of zero or more elements from that set, with string concatenation as the monoid operation and with the unique sequence of zero elements, often called the empty string and denoted by ε or λ, as the identity element. The free monoid on a set A is usually denoted A∗. The free semigroup on A is the subsemigroup of A∗ containing all elements except the empty string. It is usually denoted A+.
foaf:depiction
n10:Example_of_strings_equidivisibility.gif
dcterms:subject
dbc:Semigroup_theory dbc:Combinatorics_on_words dbc:Formal_languages dbc:Free_algebraic_structures
dbo:wikiPageID
523166
dbo:wikiPageRevisionID
1102353367
dbo:wikiPageWikiLink
n4:Example_of_strings_equidivisibility.gif dbr:Split_epimorphism dbr:Morphism dbr:Identity_element dbr:Conjugation_(group_theory) dbr:Kleene_star dbr:Endomorphism dbr:Squiggol dbr:Hall_word dbr:Prime_number dbr:Concurrent_computation dbr:String_operations dbr:Circular_shift dbr:Alphabet_(formal_languages) dbr:Category_(mathematics) dbr:Fundamental_theorem_of_arithmetic dbr:Semiautomaton dbr:Prefix_code dbr:Bit dbr:Free_group dbr:Set_(mathematics) dbr:Springer-Verlag dbc:Semigroup_theory dbr:Universal_property dbr:Multiset dbr:Monoid dbr:Identity_map dbr:Map_(higher-order_function) dbr:Syntactic_monoid dbr:Submonoid dbr:Prefix_(computer_science) dbr:Computer_science dbr:Thread_join dbr:Free_object dbr:Finite_sequence dbr:Valérie_Berthé dbr:Wojciech_Szpankowski dbr:Monoid_homomorphism dbr:Monoid_morphism dbr:Levi's_lemma dbr:Sophie_Schbath dbr:Composition_of_functions dbr:Empty_string dbr:Lyndon_word dbr:Associative dbr:Combinatorics dbr:Semigroup dbr:Semilattice dbr:Regular_language dbr:Fold_(higher-order_function) dbr:Formal_language dbr:Transition_monoid dbr:Chen–Fox–Lyndon_theorem dbr:Gesine_Reinert dbr:Parallel_computing dbr:Free_partially_commutative_monoid dbr:Cardinality dbr:Free_magma dbr:Lock_(computer_science) dbr:Cambridge_University_Press dbr:Commutative_monoid dbr:Automata_theory dbr:String_concatenation dbr:Idempotent dbr:Trace_monoid dbc:Combinatorics_on_words dbr:Natural_numbers dbr:Abstract_algebra dbr:History_monoid dbc:Free_algebraic_structures dbr:Mutex dbr:Band_(algebra) dbr:MapReduce dbr:List_(computing) dbr:Deterministic_finite_automaton dbr:Hilbert's_basis_theorem dbc:Formal_languages dbr:Isomorphic
dbo:wikiPageExternalLink
n26:appliedcombinato0000loth
owl:sameAs
wikidata:Q5500266 dbpedia-he:מונואיד_חופשי dbpedia-id:Monoid_bebas dbpedia-pt:Monoide_livre n18:4jNuH freebase:m.02l8lg dbpedia-cs:Volný_monoid dbpedia-zh:自由么半群 yago-res:Free_monoid
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Not_a_typo dbt:Commons_category-inline dbt:Unreferenced_section dbt:Citation_needed dbt:Main dbt:Citation
dbo:thumbnail
n10:Example_of_strings_equidivisibility.gif?width=300
dbo:abstract
Volný monoid na množině je v abstraktní algebře monoid, jehož prvky jsou všechny konečné posloupnosti (neboli řetězce) prvků této množiny, přičemž monoidovou operací je operace zřetězení a neutrální prvek tvořený posloupností nula prvků se nazývá prázdný řetězec, a označuje se obvykle ε nebo λ. Volný monoid nad množinou A se obvykle označuje A∗; volná pologrupa na A je podpologrupa A∗ obsahující všechny prvky kromě prázdného řetězce; obvykle se označuje A+. Obecněji, abstraktní monoid (nebo pologrupu) S nazýváme volný nebo volná, jestliže je izomorfní s volným monoidem (nebo pologrupou) nad nějakou množinou. Jak jméno naznačuje, volné monoidy a pologrupy jsou objekty které vyhovují obvyklé definující volné objekty v kategorii monoidů nebo pologrup. Z toho plyne, že každý monoid (resp. každá pologrupa) se je homomorfním obrazem volného monoidu (resp. volné pologrupy). Studium pologrup jako obrazů volných pologrup se nazývá kombinatorická teorie pologrup. 在抽象代數裡，於一集合A上的自由幺半群是指一幺半群，其元素都是由A內零個或多個元素以串接之二元運算形成的有限序列(或字符串)。通常標記為A*。其單位元為空字元串，標記為ε 或 λ。在A上的自由半群則指是A*內的子半群，其包含除了空字串外的所有元素。通常標記為A+。 更一般地，一抽象幺半群(半群)S被稱做是自由的，若其與某一集合上的自由幺半群(半群)同構。 如其名稱所述，自由幺半群(半群)為滿足定義了自由对象的泛性質的物件，在幺半群(半群)的範疇裡。它允許每一個么半群(半群)都會是某一自由幺半群(半群)的同態映像。研究半群為自由半群的映像的學科稱做。 Dalam aljabar abstrak, monoid bebas pada himpunan adalah monoid yang semua elemennya adalah (atau string) dari nol atau lebih elemen dari himpunan, dengan sebagai operasi monoid dan dengan urutan unik elemen nol, sering disebut dan dilambangkan dengan ε atau λ, sebagai elemen identitas. Monoid bebas pada himpunan A biasanya dilambangkan A∗. Semigrup bebas di A adalah subsemigrup dari A∗ mengandung semua elemen kecuali string kosong. Biasanya dilambangkan A+. Secara lebih umum, sebuah monoid abstrak (atau setengah grup) S dideskripsikan sebagai bebas jika ke monoid bebas (atau semigroup) pada beberapa set. Sesuai dengan namanya, monoid dan semigroup bebas adalah objek yang memenuhi sifat universal yang biasa mendefinisikan objek bebas, di masing-masing kategori dari monoid dan semigroup. Oleh karena itu, setiap monoid (atau semigrup) muncul sebagai citra homomorfik dari monoid bebas (atau semigrup). Studi tentang semigroup sebagai gambar dari semigrup bebas disebut teori semigroup kombinatorial. Monoid bebas (dan monoid pada umumnya) adalah asosiatif, menurut definisi; artinya, mereka ditulis tanpa tanda kurung untuk menunjukkan pengelompokan atau urutan operasi. Padanan non-asosiatifnya adalah . In abstract algebra, the free monoid on a set is the monoid whose elements are all the finite sequences (or strings) of zero or more elements from that set, with string concatenation as the monoid operation and with the unique sequence of zero elements, often called the empty string and denoted by ε or λ, as the identity element. The free monoid on a set A is usually denoted A∗. The free semigroup on A is the subsemigroup of A∗ containing all elements except the empty string. It is usually denoted A+. More generally, an abstract monoid (or semigroup) S is described as free if it is isomorphic to the free monoid (or semigroup) on some set. As the name implies, free monoids and semigroups are those objects which satisfy the usual universal property defining free objects, in the respective categories of monoids and semigroups. It follows that every monoid (or semigroup) arises as a homomorphic image of a free monoid (or semigroup). The study of semigroups as images of free semigroups is called combinatorial semigroup theory. Free monoids (and monoids in general) are associative, by definition; that is, they are written without any parenthesis to show grouping or order of operation. The non-associative equivalent is the free magma. Em álgebra abstrata, o monoide livre sobre um conjunto A é o monoide cujos elementos são todas as strings (ou sequências de caracteres) finitas formadas por zero ou mais elementos de A. Ele é normalmente denotado por A∗. O elemento de identidade é a única sequência com zero elementos, muitas vezes chamada de string vazia e denotada por ε ou λ, e a operação do monoide é a concatenação de strings. O semigrupo livre em A é o subsemigrupo de A∗ contendo todos os elementos exceto a string vazia. Ele é denotado geralmente por A+.
gold:hypernym
dbr:Monoid
prov:wasDerivedFrom
wikipedia-en:Free_monoid?oldid=1102353367&ns=0
dbo:wikiPageLength
22311
foaf:isPrimaryTopicOf
wikipedia-en:Free_monoid