Garmelon/rextra
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Improve README readability

Browse source
This commit is contained in:
Joscha 2019-10-31 19:37:39 +00:00
parent d164af275e
commit 1ae25d53bc
1 changed files with 6 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

8
README.md
View file

@ -5,11 +5,11 @@ convert between NFAs and DFAs, and minimize DFAs.
The representation of DFAs and NFAs assumes an infinite alphabet: The representation of DFAs and NFAs assumes an infinite alphabet:
DFA states always contain a default transition (marked with `*` in the * DFA states always contain a default transition (marked with `*` in
visualisations), which is taken if the current token doesn't appear in the visualisations), which is taken if the current token doesn't
any of the other transitions. appear in any of the other transitions.
NFA transitions either apply to a set of tokens, or to all tokens * NFA transitions either apply to a set of tokens, or to all tokens
*except* a specified set. In the visualisation, the character `Σ` *except* a specified set. In the visualisation, the character `Σ`
denotes the alphabet of tokens. denotes the alphabet of tokens.