# Category Archives: Theory of Computation & Automata

Prerequisite – Pushdown automata, NPDA for accepting the language L = {amb(n+m)cm | m, n >= 1} Problem: Construct Pushdown automata for L = {0m1(n+m)2n… Read More
Design a deterministic finite automata (DFA) for accepting the language For creating DFA for language L = {an bm | n+m=odd} use elementary mathematics which says-  … Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state Problem – Design a non deterministic PDA for accepting the language , i.e., L =… Read More
Prerequisite – Turing Machine The language L = {aibjck | i < j < k or i > j > k} is same as the… Read More
Prerequisite – Turing Machine In given language L = {aibjck | i< j< k; i≥ 1}, every string of ‘a’, ‘b’ and ‘c’ have certain… Read More
Prerequisite – Turing Machine In given language L = {aibjck | i>j>k; k ≥ 1}, every string of ‘a’, ‘b’ and ‘c’ have certain number… Read More
Prerequisite – Turing Machine Problem : Draw a turing machine which compare two numbers. Using unary format to represent the number. For example, 4 is… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state Problem – Design a non deterministic PDA for accepting the language L = { :… Read More
Prerequisite – Designing finite automata Reversal: We define the reversed language  to be the language , where  Steps to Reversal:  Draw the states as it is. Add a… Read More
A language is said to be regular if it can be represented by using a Finite Automata or if a Regular Expression can be generated… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state  Problem – Design a non deterministic PDA for accepting the language L = {[Tex]b^{2n}  [/Tex]: n>=1}… Read More
Prerequisite – Turing Machine, 1’s and 2’s complement of a Binary Number   Problem-1: Draw a Turing machine to find 1’s complement of a binary number. … Read More
According to the Chomsky Hierarchy, the requirement of a certain type of grammar to generate a language is often clubbed with a suitable machine that… Read More
Having gained the knowledge of how to draw a basic Finite State Machine ( DFA, NFA or  -NFA ). We head to deriving a Regular… Read More
Prerequisite – Design a Finite automata Suppose we have a DFA that is defined by ( Q, , , q0, F ) and it accepts the language L1.… Read More