Suffix automaton
Sign in to saveAlso known as Directed Acyclic Word Graph
Minimal DFA accepting set of all suffixes of particular string
In the Vinony graph
Within Vinony's link graph, Suffix automaton is referenced by 59 other articles, and connects out to formal language, directed graph and time complexity.
Vinony files it under Finite-state machines and Substring indices.
Its subject is documented across 4 Wikipedia language editions.
Wikidata facts
- Subclass of
- deterministic finite automata
- Image
- Suffix automaton for abbcbc.svg
Show 3 more facts
- native label
- suffix automaton
- Commons category
- Suffix automaton
- time of discovery or invention
- 1983-00-00
via Wikidata · CC0
Connections
formal language
Entity
directed graph
Entity
time complexity
Entity
trie
Entity
string-searching algorithm
Entity
longest common substring problem
Entity
substring
Entity
DFA minimization
Entity
computer science
Entity
International Standard Book Number
Entity
algorithm
Entity
set
Entity
digital object identifier
Entity
data structure
Entity
empty set
Entity
OCLC, Inc.
Entity
data compression
Entity
regular expression
Entity
isomorphism
Entity
arXiv
Entity