Deterministic finite automaton accepting set of all suffixes of particular string
Suffix automaton
Type
Substring index
Invented
1983
Invented by
Anselm Blumer; Janet Blumer; Andrzej Ehrenfeucht; David Haussler; Ross McConnell
Time complexity in big O notation
Operation
Average
Worst case
Space complexity
Space
In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage, processing, and retrieval of compressed information about all its substrings. The suffix automaton of a string is the smallest directed acyclic graph with a dedicated initial vertex and a set of "final" vertices, such that paths from the initial vertex to final vertices represent the suffixes of the string.
In terms of automata theory, a suffix automaton is the minimal partial deterministic finite automaton that recognizes the set of suffixes of a given string . The state graph of a suffix automaton is called a directed acyclic word graph (DAWG), a term that is also sometimes used for any deterministic acyclic finite state automaton.
Suffix automata were introduced in 1983 by a group of scientists from the University of Denver and the University of Colorado Boulder. They suggested a linear time online algorithm for its construction and showed that the suffix automaton of a string having length at least two characters has at most states and at most transitions. Further works have shown a close connection between suffix automata and suffix trees, and have outlined several generalizations of suffix automata, such as compacted suffix automaton obtained by compression of nodes with a single outgoing arc.
Suffix automata provide efficient solutions to problems such as substring search and computation of the largest common substring of two and more strings.
In computer science, a suffixautomaton is an efficient data structure for representing the substring index of a given string which allows the storage...
automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source...
node), ERA can index the entire human genome in less than 9 minutes. Suffixautomaton Donald E. Knuth; James H. Morris; Vaughan R. Pratt (Jun 1977). "Fast...
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...
finite state automaton, a data structure that represents a finite set of strings Suffixautomaton, a finite automaton that functions as a suffix index This...
character set is called a superpermutation. Brace notation Substring index Suffixautomaton Lothaire, M. (1997). Combinatorics on words. Cambridge: Cambridge University...
those of a nondeterministic finite automaton, such that the grammar generates exactly the language the automaton accepts. Hence, the right-regular grammars...
Smith–Waterman algorithm Data structure DAFSA Suffix array SuffixautomatonSuffix tree Generalized suffix tree Rope Ternary search tree Trie Other Parsing Pattern...
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...
Smith–Waterman algorithm Data structure DAFSA Suffix array SuffixautomatonSuffix tree Generalized suffix tree Rope Ternary search tree Trie Other Parsing Pattern...
case characters on a standard television set. October – A form of the suffixautomaton is introduced by Peter Weiner. November 21 – The sci-fi movie Westworld...
In computer science, a deterministic acyclic finite state automaton (DAFSA), also called a directed acyclic word graph (DAWG; though that name also refers...
method for converting a nondeterministic finite automaton (NFA) into a deterministic finite automaton (DFA) which recognizes the same formal language...
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...
instructions on how to build a full-featured home computer, Galaksija. The suffixautomaton data structure is introduced. The US Federal Government standardizes...
Smith–Waterman algorithm Data structure DAFSA Suffix array SuffixautomatonSuffix tree Generalized suffix tree Rope Ternary search tree Trie Other Parsing Pattern...
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...
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...
(finite-state) nested word automaton. Nested word automata are an automaton model accepting nested words. There is an equivalent automaton model operating on...
Smith–Waterman algorithm Data structure DAFSA Suffix array SuffixautomatonSuffix tree Generalized suffix tree Rope Ternary search tree Trie Other Parsing Pattern...
trees.: 358 A trie can be seen as a tree-shaped deterministic finite automaton. Tries support various operations: insertion, deletion, and lookup of...
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...
Global Information
