# MA-FSA

**Repository Path**: mirrors_hankcs/MA-FSA

## Basic Information

- **Project Name**: MA-FSA
- **Description**: This is a minimal acyclic finite-state automata algorithm in Java based on the paper, "Incremental Construction of Minimal Acyclic Finite-State Automata".
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-08-08
- **Last Updated**: 2026-05-23

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

This is a minimal acyclic finite-state automata algorithm in Java based on the paper, "Incremental Construction of Minimal Acyclic Finite-State Automata".

It can be used/modified for things like spell checking and autocomplete.

The included word list has ~230,000 words and searching through them is very fast. On a Core i3, I can get about ~200,000 searches in ~100ms.

Usage:

Path path = Paths.get("/path/to/wordlist.txt");
List<String> words = Files.readAllLines(path, StandardCharsets.UTF_8);

Dawg dawg = new Dawg(words);

if(dawg.search(word))
    System.out.println("Word found.");