Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Suffix automaton · Vinony

🌐English

English Русский 中文日本語

EntityQ19599738· pop 5· linked from 59 articles

Suffix automaton

Minimal DFA accepting set of all suffixes of particular string

Connections

formal language

Categories

Finite-state machines Substring indices

Sources

wikipedia.externallinksexternallink

time complexity

Entity

string-searching algorithm

longest common substring problem

DFA minimization

computer science

International Standard Book Number

digital object identifier

data compression

regular expression

Sign in to save

What links here59 pages

longest common substring problem

sequence mining

longest common subsequence problem

nondeterministic finite automaton

Aho–Corasick algorithm

Hirschberg's algorithm

Boyer–Moore string search algorithm

regular expression

Levenshtein distance

ternary search tree

bitap algorithm

Hamming distance

Knuth–Morris–Pratt algorithm

Damerau–Levenshtein distance

Jaro–Winkler distance

1983 in science

1973 in science

string-searching algorithm

regular grammar

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.64

longest common substring problem

Entitydist 0.71

Entitydist 0.71

weighted context-free grammar

Entitydist 0.72

Entitydist 0.73

Companydist 0.73

shunting-yard algorithm

Entitydist 0.74

Jaro–Winkler distance

Entitydist 0.74

Quatuor Mosaïques

Entitydist 0.74

Siegel modular form

Entitydist 0.76

Companydist 0.76