Please enable JavaScript.
Coggle requires JavaScript to display documents.
Theory of computation (Regulat expression language , grammer and finite…
Theory of computation
Regulat expression language , grammer and finite autimata
introduction of theory of computation
finite automata
chomsky hirarchy
regualr grammer experssion and language
pumping lemma
arden's theorem
designing finite automata from regular expression
NFA with epsilon moce to DFA conversion
minimization of DFA
generating regualr expression from finite autimata
union and intersection of reulgar grammer
designign deteministic finite autimata
dedigning deterministiv finite autimata
DFA of a string
Union process in DFA
concatenation process in DFA
star height of regular ecpression and regular lanfuafe
mealy and moore machines
difference between mealy machine and moore machine
context free grammars and puch -down automata
push doen automata
pushdown automata acceptance bu final state
construct pushdoen automata for given language
construct pushdown automata for L = )m1m2m3n
construct push doen automata for all lengthpallindrome
NPDA for the language l={a,b*}
NPDA for accepting anbn
NPDA for different types
closure properties of context free language
ambiguity in cfg and cfl
simplifying context free grammars
converting context free grammar to chomsky normal form
converting context free grammar to greibach normal form
relationship betwenn grammar and language
turing machines
recursive and recurisive enumerable language
turing machine
turing machine for addition
turing maching for untraction turing maching for multiplication
turing machine for copying data
construct a turin maching for 0n1n2M
construct a turinin machine for language wwr
construct a truring maching for ww
construct a turing machine for anbma(n+m)
proof of hamiltonian path is NP - complete
deciadability and undecidable problens
undecidability and reducibility
Context Senctivelanguage
context sensitive grammer and language