mirrors
/
regex2fat
mirror of https://github.com/8051Enthusiast/regex2fat
1
0
Fork 0
Code Issues Releases Wiki Activity

deterministic finite automaton

This commit is contained in:
Russ Nelson 2020-04-15 23:39:58 -04:00
parent d137dfb779
commit e48227de2a
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -15,7 +15,7 @@ The file created will be a fat32 image, which can probably be mounted or put on
## FAQ
### Q: How does this work?
A: Regular regexes (i.e. no backreferences and similar advanced features) can be turned into a so called DFA (deterministic state automaton).
A: Regular regexes (i.e. no backreferences and similar advanced features) can be turned into a so called DFA (deterministic finite automaton).
This is basically a bunch of arrows going between states, where an arrow is labeled with a letter so that a letter in a state causes the current state to go along the arrow to another state, with a subset of states being accepting.
Yes, I'm bad at explaining, you're better off reading [the wikipedia article on DFAs](https://en.wikipedia.org/wiki/Deterministic_finite_automaton) if you don't know what it is.