Category Archives: Theory of Computation & Automata

Given a string S, the task is to design a Deterministic Finite Automata (DFA) for accepting the language L = C (A + B)+. If… Read More
Prerequisite – Theory of Computation Grammar :It is a finite set of formal rules for generating syntactically correct sentences or meaningful correct sentences. Constitute Of… Read More
Non-Deterministic Finite Automata and ∈-Non-Deterministic Finite Automata are almost the same except for their transition function and there are a few special rules for construction… Read More
Prerequisite: Finite Automata Given a string S of size N, the task is to design a Deterministic Finite Automata (DFA) for accepting the language L… Read More
Non-Deterministic Finite Automata and ∈-Non-Deterministic Finite Automata are almost the same except for their transition function and there are a few special rules for construction… Read More
Given a binary string S, the task is to write a program for DFA Machine that accepts a set of all strings over w ∈… Read More
Prerequisite – Turing Machine Task : Our task is to design a Turing Machine for an equal number of a’s and b’s. Analysis : Here… Read More
Prerequisite – Introduction of Finite Automata Non-Deterministic Finite Automata and ∈-Non-Deterministic Finite Automata are almost the same except for their transition function and there are… Read More
Prerequisite – Turing Machine Task : We have to design a Turing machine for anbn where n>=1. Analysis : We can analyze that we have… Read More
Prerequisite – Introduction of Finite Automata Non-Deterministic Finite Automata and ∈-Non-Deterministic Finite Automata are almost the same except for their transition function and there are… Read More
Given a binary string S, the task is to write a program for DFA Machine that accepts a string with odd numbers of 0s and… Read More
Prerequisite : Turing Machine Task : Our task is to design a Turing machine to reverse a string consisting of a’s and b’s. Examples :… Read More
In this article, we will design the Deterministic Finite Automata of the Regular Language L ={w ∈ {a, b}* : Na(w) mod 3 > Nb(w)… Read More
Prerequisite : Turing Machine Task : We have to design a Turing Machine for incrementing the Binary Number by 1. Examples – Input: 10111 Output:… Read More
Prerequisite – Turing Machine Task : We have to design a Turing machine for a^i b^j where i<j and i>0. Analysis : Here the main… Read More