Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Suffix_automaton> ?p ?o }
Showing triples 1 to 31 of
31
with 100 triples per page.
- Suffix_automaton abstract "In computer science, a suffix automaton is a data structure that efficiently represents the suffixes of a string. For example, a suffix automaton for the string "suffix" can be queried for other strings; it will report "true" for any of the strings "suffix", "uffix", "ffix", "fix", "ix" and "x", and "false" for any other string. The suffix automaton of a set of strings U has at most 2Q − 2 states, where Q is the number of nodes of a prefix-tree representing the strings in U.A suffix automaton is a type of finite state machine. It can be regarded as a compressed suffix trie.".
- Suffix_automaton thumbnail Suffix_automaton.svg?width=300.
- Suffix_automaton wikiPageID "44050791".
- Suffix_automaton wikiPageLength "1580".
- Suffix_automaton wikiPageOutDegree "6".
- Suffix_automaton wikiPageRevisionID "678516147".
- Suffix_automaton wikiPageWikiLink Category:String_data_structures.
- Suffix_automaton wikiPageWikiLink Computer_science.
- Suffix_automaton wikiPageWikiLink Finite-state_machine.
- Suffix_automaton wikiPageWikiLink Finite_state_machine.
- Suffix_automaton wikiPageWikiLink Suffix_array.
- Suffix_automaton wikiPageWikiLink Suffix_tree.
- Suffix_automaton wikiPageWikiLink Suffix_trie.
- Suffix_automaton wikiPageWikiLink File:Suffix_automaton.svg.
- Suffix_automaton wikiPageWikiLinkText "suffix automaton".
- Suffix_automaton hasPhotoCollection Suffix_automaton.
- Suffix_automaton wikiPageUsesTemplate Template:Comp-sci-stub.
- Suffix_automaton wikiPageUsesTemplate Template:Math.
- Suffix_automaton wikiPageUsesTemplate Template:Mvar.
- Suffix_automaton wikiPageUsesTemplate Template:Reflist.
- Suffix_automaton subject Category:String_data_structures.
- Suffix_automaton hypernym Structure.
- Suffix_automaton type Building.
- Suffix_automaton comment "In computer science, a suffix automaton is a data structure that efficiently represents the suffixes of a string. For example, a suffix automaton for the string "suffix" can be queried for other strings; it will report "true" for any of the strings "suffix", "uffix", "ffix", "fix", "ix" and "x", and "false" for any other string.".
- Suffix_automaton label "Suffix automaton".
- Suffix_automaton sameAs m.0121svzq.
- Suffix_automaton sameAs Q19599738.
- Suffix_automaton sameAs Q19599738.
- Suffix_automaton wasDerivedFrom Suffix_automaton?oldid=678516147.
- Suffix_automaton depiction Suffix_automaton.svg.
- Suffix_automaton isPrimaryTopicOf Suffix_automaton.