Skip to content

Update README.md #8

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
jonasagx wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update README.md #8

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ computations that are easier understood when transitions are specified explicitl
API is more interested in using the DFA to clearly define stateful computation, rather
than actually being used to recognize languages.

The implementation has all the normal compnents:
The implementation has all the normal components:

* a finite set of states (Q)
* a finite set of input symbols called the alphabet (Σ)
Expand Down Expand Up @@ -157,4 +157,4 @@ digraph {
Which when given to the [GraphViz](http://graphs.grevian.org/graph) command line tool
would visualize the DFA like this:

![DFA](/dfa.png)
![DFA](/dfa.png)