Do urgent Automata, Computability, Complexity ,Computation projects

Do urgent Automata, Computability, Complexity ,Computation projects

Regular Language and N-reg Languages

Deterministic Finite Automata ( DFA )

Non deterministic Finite Automata ( NFA/ EpsilonNFA )

Regular Expression (Regex) (RE)

Transition Graph TG

Finite Automata to Regular Expression ( DFA 2 RE )

Regular Expression to Finite Automata ( RE 2 FA )

Regular Grammar to Finite Automata

Kleene and positive closure

Pumping Lemma ( CFG / RL )

Context Free Grammar (CFG)

Pushdown Automata (PDA)

Non det Pushdown Automata ( NPDA )

Pushdown Automata To Context free grammer PDA to CFG

Context free grammer To Pushdown Automata CFG to PDA

Ambiguity in Context Free Grammar

Parse Tree and Derivation in CFG

Chomsky Normal Form ( CNF)

Greibach Normal Form ( GNF )

Turing Machine

Turing Machine Variants

Multitape Turing Machine

Universal Turing Machine

Decideability with Turing

Time Complexity