Turing Machine
What is Turing Machine in TOC? Turing Machine recognizes the recursive enumerable language. Turing Machine is more powerful than any
Read More
Theory of Computation
Greibach Normal Form (GNF)
Greibach Normal Form (GNF) in Compiler Design A CFG G = (V, T, P, S) is in Greibach Normal Form
Read MoreChomsky Normal Form (CNF)
Chomsky Normal Form (CNF) in Compiler Design Any context free grammar G = (V, T, S, P) with λ ∉
Read MoreLeft Most Derivation and Right Most Derivation
Left Most Derivation and Right Most Derivation – Computer Science In CFGs that are not linear, a derivation way involve
Read MoreContext Free Grammar
Definition A context-free grammar G is a quadruple (V, T, P, S), where: V is the set of non-terminals. (Non-terminals
Read MoreRegular Expressions
Regular Expression in Compiler Design One day of describing regular language of via the notation of regular expressions. This notation
Read MoreDETERMINISTIC FINITE AUTOMATA (DFA)
What is deterministic finite automata? If for every input symbol of an alphabet there is an exactly one transition from
Read More
What is Theory of Computation?
Theory of computation deals with the automata theory and formal languages. It is the study of “Abstract Model of Computation”.
Read MoreFinite Automata
What is Finite Automata? Finite Automaton (FA) is also called as Finite State machine (FSM). Finite Automaton has no temporary
Read More