State diagram of DFA.
Image 1.0.0: State diagram of DFA.
State diagram of DFA.
Image 1.0.1: State diagram of DFA.
State diagram of DFA with Unicode alphabet.
Image 1.0.2: State diagram of DFA with Unicode alphabet.
State diagram of NFA.
Image 1.0.3: State diagram of NFA recognising language of $$\{aa, aab\}^*\{b\}$$.
Computation of NFA as a tree.
Image 1.0.4: Computation of NFA as a tree.
State diagram of DFA equivalent to NFA.
Image 1.0.5: State diagram of DFA equivalent to NFA.
State diagram of ε-NFA.
Image 1.0.6: State diagram of ε-NFA recognising language of $$(ab ∪ a)^*$$.
Shows how ε-NFA accepts ab string.
Image 1.0.7: Shows how ε-NFA accepts $$ab$$ string.
JavaFx breakout clone.
Image 1.0.8: JavaFx breakout clone.
Learning Journal Main Page.
Image 1.0.9: Learning Journal Main Page.
Learning Journal Guide Page.
Image 1.1.0: Learning Journal Guide Page.
Aliquam - Jekyll Theme.
Image 1.1.1: Aliquam - Jekyll Theme.
Cashier terminal, showing order confirmation.
Image 1.1.2: Cashier terminal, showing order confirmation.
ε-NFA to be converted to DFA.
Image 1.1.3: ε-NFA to be converted to DFA.
Initial DFA with only start state.
Image 1.1.4: Initial DFA with only start state.
DFA after adding transitions from start state $$\{q_0, q_2\}$$.
Image 1.1.5: DFA after adding transitions from start state $$\{q_0, q_2\}$$.
DFA after adding transitions from state $$\{q_1\}$$.
Image 1.1.6: DFA after adding transitions from state $$\{q_1\}$$.
DFA after adding transitions from state $$\{q_1, q_2\}$$.
Image 1.1.7: DFA after adding transitions from state $$\{q_1, q_2\}$$.
DFA after adding transitions from state $$\{q_2\}$$.
Image 1.1.8: DFA after adding transitions from state $$\{q_2\}$$.
Final DFA.
Image 1.1.9: Final DFA.