# Category Archives: Theory of Computation

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
State Elimination Method : Rules to convert a DFA/NFA//Ɛ-NFA into corresponding Regular Expression. Arden’s Method is not capable of converting Ɛ-NFA. By state elimination method… 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
Moore Machines: A Moore Machine is basically a DFA with an output associated with every state. These machines can be used for a wide variety… Read More
In this article, we are going to describe the basics concepts of the restricted Turing machine and for basic understanding, you can first read the… Read More
Regular Expression can be anything, from a terminal symbol, ∅, to union of two regular expressions (R1 + R2), their concatenation (R1R2) or its closure… Read More
BNF stands for Backus Naur Form notation. It is a formal method for describing the syntax of programming language which is understood as Backus Naur… Read More