In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage...
55 KB (8,334 words) - 06:31, 14 April 2025
automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source...
29 KB (4,499 words) - 06:31, 14 April 2025
already been given to a different data structure which is related to suffix automaton. A DAFSA is a special case of a finite state recognizer that takes...
8 KB (972 words) - 06:30, 14 April 2025
Longest common substring (section Suffix tree)
time with a generalized suffix tree. The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings...
8 KB (1,063 words) - 08:25, 11 March 2025
node), ERA can index the entire human genome in less than 9 minutes. Suffix automaton Donald E. Knuth; James H. Morris; Vaughan R. Pratt (Jun 1977). "Fast...
29 KB (3,710 words) - 22:18, 27 April 2025
include: The suffix tree, a radix tree of the suffixes of the string, allowing substring search to be performed symbol-by-symbol The suffix automaton, the minimal...
5 KB (611 words) - 08:19, 10 January 2025
Substring (redirect from Suffix (computer science))
character set is called a superpermutation. Brace notation Substring index Suffix automaton Lothaire, M. (1997). Combinatorics on words. Cambridge: Cambridge University...
6 KB (833 words) - 00:04, 21 December 2023
transforming a regular expression into an equivalent nondeterministic finite automaton (NFA). This NFA can be used to match strings against the regular expression...
14 KB (1,221 words) - 06:31, 14 April 2025
Aho–Corasick algorithm (redirect from Aho-Corasick Automaton)
share a common suffix (e.g., in the previous case, a branch for attribute might be the best lateral transition). This allows the automaton to transition...
10 KB (1,255 words) - 01:59, 19 April 2025
DAFSA Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array LCP array FM-index Generalized suffix tree Rope Ternary search...
22 KB (2,578 words) - 20:40, 14 April 2025
DAFSA Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array LCP array FM-index Generalized suffix tree Rope Ternary search...
35 KB (4,355 words) - 22:13, 6 April 2025
each word is not required), a minimal deterministic acyclic finite state automaton (DAFSA) would use less space than a trie or a ternary search tree. This...
14 KB (1,784 words) - 21:43, 13 November 2024
subsequence subset substring subtree succinct data structure suffix suffix array suffix automaton suffix tree superimposed code superset supersink supersource...
35 KB (3,135 words) - 18:46, 6 May 2025
those of a nondeterministic finite automaton, such that the grammar generates exactly the language the automaton accepts. Hence, the right-regular grammars...
8 KB (988 words) - 21:36, 23 September 2024
DAFSA Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array LCP array FM-index Generalized suffix tree Rope Ternary search...
16 KB (1,779 words) - 08:23, 10 January 2025
finite state automaton, a data structure that represents a finite set of strings Suffix automaton, a finite automaton that functions as a suffix index This...
325 bytes (77 words) - 14:53, 23 July 2019
DAFSA Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array LCP array FM-index Generalized suffix tree Rope Ternary search...
9 KB (1,125 words) - 03:48, 20 January 2025
theory, a timed automaton is a finite automaton extended with a finite set of real-valued clocks. During a run of a timed automaton, clock values increase...
10 KB (1,603 words) - 06:35, 20 July 2024
Nested word (redirect from Visibly pushdown automaton)
(finite-state) nested word automaton. Nested word automata are an automaton model accepting nested words. There is an equivalent automaton model operating on...
20 KB (3,063 words) - 00:45, 14 November 2024
DAFSA Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array LCP array FM-index Generalized suffix tree Rope Ternary search...
4 KB (510 words) - 23:18, 19 December 2023
Powerset construction (redirect from Determinization of Automaton)
method for converting a nondeterministic finite automaton (NFA) into a deterministic finite automaton (DFA) which recognizes the same formal language...
12 KB (1,500 words) - 06:31, 14 April 2025
filtering, and the Aho-Corasick. To do this, the algorithm implements a suffix automaton to search through patterns within an input string, while also using...
7 KB (788 words) - 05:19, 11 March 2025
instructions on how to build a full-featured home computer, Galaksija. The suffix automaton data structure is introduced. The US Federal Government standardizes...
12 KB (1,275 words) - 17:07, 16 June 2024
case characters on a standard television set. October – A form of the suffix automaton is introduced by Peter Weiner. November 21 – The sci-fi movie Westworld...
12 KB (1,274 words) - 16:00, 25 July 2024
approach, backtracking is avoided by constructing a deterministic finite automaton (DFA) that recognizes a stored search string. These are expensive to construct—they...
18 KB (1,970 words) - 20:41, 23 April 2025
for jin deui (pastry made from glutinous rice) in the Philippines Büchi automaton, finite state automata extended to infinite inputs Büchi arithmetic, a...
1 KB (155 words) - 10:17, 31 December 2023
science, a signal automaton is a finite automaton extended with a finite set of real-valued clocks. During a run of a signal automaton, clock values increase...
13 KB (2,381 words) - 17:11, 29 July 2024
trees.: 358 A trie can be seen as a tree-shaped deterministic finite automaton. Tries support various operations: insertion, deletion, and lookup of...
31 KB (3,328 words) - 16:38, 7 May 2025
is a finite-state automaton that can efficiently search for factors (substrings) in a body of text. Older techniques, such as suffix trees, were time-efficient...
2 KB (181 words) - 15:28, 20 December 2024
Equivalently, it is a language recognised by a local automaton, a particular kind of deterministic finite automaton. Formally, a language L over an alphabet A is...
3 KB (401 words) - 21:30, 1 November 2024