Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Implementation of directed acyclic word graph

Miroslav Balík — 2002

Kybernetika

An effective implementation of a Directed Acyclic Word Graph (DAWG) automaton is shown. A DAWG for a text T is a minimal automaton that accepts all substrings of a text T , so it represents a complete index of the text. While all usual implementations of DAWG needed about 30 times larger storage space than was the size of the text, here we show an implementation that decreases this requirement down to four times the size of the text. The method uses a compression of DAWG elements, i. e. vertices,...

Page 1

Download Results (CSV)