Skip to content

Category Archives: Theory of Computation & Automata

There are two Pumping Lemmas, which are defined for 1. Regular Languages, and 2. Context – Free Languages   Pumping Lemma for Regular Languages For… Read More
See Last Minute Notes on all subjects here. We will discuss the important key points useful for GATE exams in summarized form. For details you… Read More
According to Chomsky hierarchy, grammar is divided into 4 types as follows:  Type 0 is known as unrestricted grammar. Type 1 is known as context-sensitive… Read More
Finite Automata(FA) is the simplest machine to recognize patterns. The finite automata or finite state machine is an abstract machine that has five elements or… Read More

Start Your Coding Journey Now!