Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Deterministic_acyclic_finite_state_automaton> ?p ?o }
Showing triples 1 to 51 of
51
with 100 triples per page.
- Deterministic_acyclic_finite_state_automaton abstract "In computer science, a deterministic acyclic finite state automaton (DAFSA),also called a directed acyclic word graph (DAWG; though that name also refers to a related data structure that functions as a suffix index)is a data structure that represents a set of strings, and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length. Algorithms exist to construct and maintain such automata, while keeping them minimal.A DAFSA is a special case of a finite state recognizer that takes the form of a directed acyclic graph with a single source vertex (a vertex with no incoming edges), in which each edge of the graph is labeled by a letter or symbol, and in which each vertex has at most one outgoing edge for each possible letter or symbol. The strings represented by the DAFSA are formed by the symbols on paths in the graph from the source vertex to any sink vertex (a vertex with no outgoing edges). In fact, a deterministic finite state automaton is acyclic if and only if it recognizes a finite set of strings.".
- Deterministic_acyclic_finite_state_automaton thumbnail Trie-vs-minimal-acyclic-fa.svg?width=300.
- Deterministic_acyclic_finite_state_automaton wikiPageExternalLink cwg.html.
- Deterministic_acyclic_finite_state_automaton wikiPageExternalLink dawg.html.
- Deterministic_acyclic_finite_state_automaton wikiPageExternalLink scrabble.pdf.
- Deterministic_acyclic_finite_state_automaton wikiPageID "6022680".
- Deterministic_acyclic_finite_state_automaton wikiPageLength "6502".
- Deterministic_acyclic_finite_state_automaton wikiPageOutDegree "18".
- Deterministic_acyclic_finite_state_automaton wikiPageRevisionID "706258232".
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Category:Finite_automata.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Category:Graph_data_structures.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Category:String_data_structures.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Computer_science.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink DFA_minimization.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Data_structure.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Deterministic_finite_automaton.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Directed_acyclic_graph.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Finite-state_machine.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink If_and_only_if.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Lecture_Notes_in_Computer_Science.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Regular_language.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Springer_Science+Business_Media.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink String_(computer_science).
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Suffix_automaton.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink Trie.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLink File:Trie-vs-minimal-acyclic-fa.svg.
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLinkText "Deterministic acyclic finite state automaton".
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLinkText "deterministic acyclic finite state automaton".
- Deterministic_acyclic_finite_state_automaton wikiPageWikiLinkText "directed acyclic word graphs".
- Deterministic_acyclic_finite_state_automaton wikiPageUsesTemplate Template:Citation.
- Deterministic_acyclic_finite_state_automaton wikiPageUsesTemplate Template:Data_structures.
- Deterministic_acyclic_finite_state_automaton wikiPageUsesTemplate Template:Formal_languages_and_grammars.
- Deterministic_acyclic_finite_state_automaton wikiPageUsesTemplate Template:Reflist.
- Deterministic_acyclic_finite_state_automaton wikiPageUsesTemplate Template:Strings.
- Deterministic_acyclic_finite_state_automaton subject Category:Finite_automata.
- Deterministic_acyclic_finite_state_automaton subject Category:Graph_data_structures.
- Deterministic_acyclic_finite_state_automaton subject Category:String_data_structures.
- Deterministic_acyclic_finite_state_automaton hypernym Structure.
- Deterministic_acyclic_finite_state_automaton type Building.
- Deterministic_acyclic_finite_state_automaton type Object.
- Deterministic_acyclic_finite_state_automaton type Structure.
- Deterministic_acyclic_finite_state_automaton comment "In computer science, a deterministic acyclic finite state automaton (DAFSA),also called a directed acyclic word graph (DAWG; though that name also refers to a related data structure that functions as a suffix index)is a data structure that represents a set of strings, and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length.".
- Deterministic_acyclic_finite_state_automaton label "Deterministic acyclic finite state automaton".
- Deterministic_acyclic_finite_state_automaton sameAs Q17008992.
- Deterministic_acyclic_finite_state_automaton sameAs ماشین_غیر_مدور_قطعی_متناهی.
- Deterministic_acyclic_finite_state_automaton sameAs Aciklički_deterministički_konačni_automat.
- Deterministic_acyclic_finite_state_automaton sameAs m.0fl13_.
- Deterministic_acyclic_finite_state_automaton sameAs Q17008992.
- Deterministic_acyclic_finite_state_automaton wasDerivedFrom Deterministic_acyclic_finite_state_automaton?oldid=706258232.
- Deterministic_acyclic_finite_state_automaton depiction Trie-vs-minimal-acyclic-fa.svg.
- Deterministic_acyclic_finite_state_automaton isPrimaryTopicOf Deterministic_acyclic_finite_state_automaton.