https://github.com/brthor/universal-finite-state-automaton
C++ Program for interpreting any finite state automata and determining if certain strings exist in the language defined. Supports non-deterministic FSA's without empty moves as well.
https://github.com/brthor/universal-finite-state-automaton
Last synced: about 1 year ago
JSON representation
C++ Program for interpreting any finite state automata and determining if certain strings exist in the language defined. Supports non-deterministic FSA's without empty moves as well.
- Host: GitHub
- URL: https://github.com/brthor/universal-finite-state-automaton
- Owner: brthor
- Created: 2014-10-17T04:27:03.000Z (almost 12 years ago)
- Default Branch: master
- Last Pushed: 2014-10-17T04:30:55.000Z (almost 12 years ago)
- Last Synced: 2025-05-15T09:43:26.704Z (about 1 year ago)
- Language: C++
- Size: 129 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
Universal-Finite-State-Automaton
================================
C++ Program for interpreting any finite state automata and determining if certain strings exist in the language defined. Supports non-deterministic FSA's without empty moves as well.