Please enable JavaScript.
Coggle requires JavaScript to display documents.
Computing - Coggle Diagram
Computing
Theory Of Computing
Regular Languages
Automata
Finite Automata
-
NFA
NFA with e-moves
-
nondeterminism can be tamed but can result in exponential increase in states so we use e-moves instead
-
-
-
-
-
-
Language
Regular Language
-
Accepted precisely by DFAs,NFAs and eNFAs
-
-
-
-
-
-
-
Context Free
CFG
-
-
parse tree of CFG derivation can be used to show pumping lemma can be used to prove if a language if CF
like with proving recursive/r.e languages, the CONTRAPOSITIVE of the PUMPING LEMMA can be used to show a lnaguage is not context free
-
-
-
-
-