A deterministic linear bounded automaton (LBA) is 9-tuple automataG = ( Q, Σ, E, δ, ε, q0, GL, GR, F)Where, Q is set of all statesΣ is set of all terminalsE input alphabet.δ is set of transitionsq0 initial stateGL left bound of tapeGR right bound of tape.F set of final ... Read More

The Post Correspondence Problem (PCP) was introduced by Emil Post in 1946 and is an undecidable decision problem.The PCP problem over an alphabet Σ is state. Given the following two lists, M and N of non-empty strings over Σ−M = (x1, x2, x3, ………, xn) N = (y1, y2, y3, ... Read More

It is the subset(minimum size) of vertices of a graph G such that every edge in G incident to at least one vertex in G.Vertex Cover (VC) ProblemTo prove VC is NP-complete we have to prove the following −VC is Non-deterministic Polynomial (NP).A NPC problem can be reduced into VC.To ... Read More

A Hamilton cycle is a round trip path along n edges of graph G which visits every vertex once and returns to its starting vertexExampleGiven below is an example of the Hamilton cycle path −Hamilton cycle path: 1, 2, 8, 7, 6, 5, 4, 3, 1TSP is NP-CompleteThe travelling salesman ... Read More

The Non-deterministic Polynomial (NP) problems were a little harder to understand. In terms of solving a NP problem, the run-time is not polynomial. It would be something like O(n!) or something larger.However, this class of problems are given a specific solution, and checking the solution would have a polynomial run-time.For ... Read More

The Non-deterministic Polynomial (NP) problems were a little harder to understand. In terms of solving a NP problem, the run-time cannot be polynomial. It would be something like O(n!) or something larger.However, this class of problems are given a specific solution, and checking the solution would have a polynomial run-time.For ... Read More

There are two types of languages in the theory of computation (TOC), which are as follows −DecidableUndecidableA problem is called decidable, when there is a solution to that problem and also can construct algorithms corresponding to that.Example of Decidable ProblemFind all the odd numbers in the range from 1 to ... Read More

Before we understand about the decidable and undecidable problems in the theory of computation (TOC), we must learn about the decidable and undecidable language. Hence, let us first see what do you mean by decidable language.Decidable LanguageA language L is called decidable if there is a decider M such that ... Read More

Usually, programs consist of loops that are limited or unlimited in length.The total work done by the program completely depends on the input given to the program.The program may consist of several different numbers of loops that may be in linear or nested manner.The Halting Problem is the problem of ... Read More

A Turing machine is a seven tuples(Q, Σ, Γ, δ, q0, qacc, qrej)Where, Q is a finite set of states;Σ is the input alphabet does not contain the blank symbol t;Γ is the tape alphabet, where t ∈ Γ and Σ ⊆ Γ;δ: (Q × Γ) → (Q × Γ ... Read More