Skip to content

# Category Archives: Theory of Computation & Automata

Prerequisite – Designing finite automata Problem – Construct a DFA machine over input alphabet = {0, 1}, that accepts: Odd number of 0’s or even… Read More
Arden’s theorem state that: “If P and Q are two regular expressions over , and if P does not contain , then the following equation… Read More
Prerequisite – Turing Machine Problem – Draw a Turing machine which copy data.  Example –    Steps:   Step-1. First convert all 0’s, 1’s into 0’s, 1’s… Read More
Mealy Machine is defined as a machine in the theory of computation whose output values are determined by both its current state and current inputs.… Read More
Prerequisite – Turing Machine Problem-1: Draw a Turing machine which subtract two numbers. Example: Steps: Step-1. If 0 found convert 0 into X and go… Read More
Prerequisite – Turing Machine Problem: Draw a turing machine which multiply two numbers. Example: Steps: Step-1. First ignore 0’s, C and go to right &… Read More
Prerequisite : NP-Completeness The class of languages for which membership can be decided quickly fall in the class of P and The class of languages… Read More
L = {an bm a(n+m) | n,m≥1} represents a kind of language where we use only 2 character, i.e., a and b. The first part… Read More
Prerequisite – Turing Machine A number is represented in binary format in different finite automata. For example, 5 is represented as 101. However, in the case… Read More
Prerequisite – Mealy and Moore machines A sequence detector is a sequential state machine that takes an input string of bits and generates an output 1… Read More
Que-1: Draw a deterministic and non-deterministic finite automate which either starts with 01 or end with 01 of a string containing 0, 1 in it,… Read More
Que-1: Draw a deterministic and non-deterministic finite automate which accept 00 and 11 at the end of a string containing 0, 1 in it, e.g.,… Read More
Problem – Draw deterministic finite automata (DFA) of a string with at least two 0’s and at least two 1’s. The first thing that come… Read More
Problem – Accept Strings that not ending with substring “THE”. Check if a given string is ending with “the” or not. The different forms of… Read More
Prerequisite – Turing Machine The language L = {ww | w ∈ {0, 1}} tells that every string of 0’s and 1’s which is followed by… Read More