The Automata theory is the study of automata and abstract machines and also the computational problems which solved using them. Automata mean self-acting.

Chomsky Normal Form (CNF)

Chomsky Normal Form (CNF) It cannot contain the null, that CFG in which non-terminals belongs to two non-terminal. Or non-terminal belongs to only one terminal and non-terminal does not null,…

Continue Reading Chomsky Normal Form (CNF)

CFG Properties and Applications

CFG Properties and Applications CFG- Context-free grammar is closure under: Union Concatenation Kleene Star Operation Union: Let suppose L1 and L2 are languages, they must have the finite set of…

Continue Reading CFG Properties and Applications

Ambiguity in CFG

Ambiguity in CFG Something when having more meaning and confusion occurs when select appropriate mean for the selected condition called Ambiguity. If a Context-Free Grammar can be drawn with more…

Continue Reading Ambiguity in CFG

CFG- Context Free Grammar

CFG- Context-Free Grammar CFG- Context-free grammar is semantic free grammar. CFG has the following terms. Terminals Non Terminals Production ǀ Rule Terminals:  By using the terminals we can terminate our…

Continue Reading CFG- Context Free Grammar

Pumping Lemma

Pumping Lemma (PL) Without any proof the string or language is accepted as true, this process is known as Pumping lemma. Pumping Theorem Let ‘L’ be a regular language. There…

Continue Reading Pumping Lemma