Incremental construction of DFA in F#

Vyacheslav Chernykh

Rate me:

5.00/5 (2 votes)

3 Aug 2016MIT6 min read

13.3K

F#-implementation of algorithm for incremental construction of minimal deterministic finite automata through adding and removing strings.

Views

Daily Counts

Weekly Counts

This article, along with any associated source code and files, is licensed under The MIT License

Written By

Vyacheslav Chernykh

Russian Federation

My open-source projects are available at the GitHub: https://github.com/Feofilakt.