LT World

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.


http://www.eti.pg.gda.pl/katedry/kiw/pracownicy/Jan.Daciuk/personal/fsm_algorithms/