From 6c91c1d4ef8495cf4a1b0ed4b807ffecc857d939 Mon Sep 17 00:00:00 2001 From: Jonas Xavier Date: Wed, 17 Jan 2018 17:13:21 -0800 Subject: [PATCH] Update README.md --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index b01c549..73b75d2 100644 --- a/README.md +++ b/README.md @@ -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 (Σ) @@ -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) \ No newline at end of file +![DFA](/dfa.png)