Skip to content

# Category Archives: Theory of Computation & Automata

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
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
Given a binary string str, the task is to build a DFA that accepts the languages ending with “01” over the characters {0, 1}. Examples:… Read More
1. Finite Automata: The finite automata or finite state machine is an abstract machine that has five elements or tuples. It has a set of… Read More
Prerequisite – Turing Machine Design a Turing Machine for a string which contains exactly 3 repetitions of w consecutively. Approach Used : First, we will… Read More