Finite-state automata (FSA) and directed acyclic word graphs (DAWG) — LT World

LT World

Supporters

provided by

dfki logo

with support by

eu star logofp7 logo

through

meta logo
clarin logo

as well as by

bmbf logo

through

take logo

N.B.

This site uses Google Analytics to record statistics about site visits - seeĀ Legal Information.

You are here: Home kb Information & Knowledge Information Sources Relevant Sources Finite-state automata (FSA) and directed acyclic word graphs (DAWG)

Finite-state automata (FSA) and directed acyclic word graphs (DAWG)


This page is an attempt to gather information about various automata-related and DAWG-related resources in one place. The need for it became obvious as

more and more people are rediscovering the same algorithms and methods, sometimes using different terminology. Additions and corrections

are welcome - send them to the maintainer.