Design a Turing Machine Turing Machine is the important topic of the Theory Of Computation. Similarly, Theory Of Computation is the Important subject of the Computer. Design a TM Accepting {a,b}*{aba} […]

# Theory of Computation

## Theorem: Let f: Ʃ1*→Ʃ2* – Theory of Computation | Freestudy9

Theorem: Let f: Ʃ1*àƩ2*. Then f is computable if and only if f is μrecursive A theorem is the important topic of the Theory Of Computation. Theory Of Computation is the Important subject of the Computer. Theorem Proof of Theorem: As above, we denote by g1 and g2 the Godel-numbering function for the two alphabets, […]

## Unions, Concatenations and Kleen’s of Context free language | TOC

Unions, Concatenations & Kleen’s: Context-free language Unions, Concatenations & Kleen’s is the important topic of the Theory Of Computation. Theory Of Computation is the Important subject of the Computer. Unions, Concatenations & Kleen’s Theorem:- If L1 and L2 are context-free languages, then the languages L1 U L2, L1L2, and L1* are also CFLs. The proof […]

## Top-Down PDA Corresponding to a CFG – Theory of Computation

Top-Down PDA corresponding to a CFG Top-Down PDA is the important topic of the Subject Theory Of Computation. Top-Down PDA Let G=(V,Ʃ,S,P) be a CFG, we define M=(Q,Ʃ,┌,q0,Z0,A, δ) as follow: Q={ q0,q1,q2,} A={q2} ┌=VUƩU{Z0} The initial move of M is to place S on the stack and move to q1: δ(q0,˄, Z0)={(q1, SZ0)} The only move […]

## 2 is Irrational Number – Theory Of Computation | Freestudy9

2 irrational number The 2 irrational number is the important topic of the Subject Theory Of Computation. 2 irrational number Suppose for the sake of contradiction that is rational. Then there are integers m’ and n’ with = m’/ n’. By dividing both m’ and n’ by all the factors that are common to both, we […]

## Quantified Statement: Prime – Theory Of Computation | Freestudy9

Quantified Statement: Prime Quantified Statement: Prime is the important topic of the Subject Theory Of Computation. For any integers a and b, if a and b are odd, then ab is odd. Proof: Quantified Statement: Prime An integer n is odd if there exists an integer x so that n=2x+1. Now let a and b be […]

## TOC Functions – Theory Of Computation | Freestudy9

TOC Functions TOC Functions is the important topic of the Subject Theory Of Computation. Prove that Functions f: R → R, f(x) = x2 is not one-to-one and not onto function. The range and codomain of f(x) = x2 are not equal or every element of codomain is not actually one of the values of the function. […]

## Basic Terms – Theory Of Computation(TOC) | Freestudy9

Basic Terms Again Basic Terms of TOC is the important topic of the Subject Theory Of Computation. Set: Set defined as a collection of objects. These objects called elements of the set. All the elements enclosed in a curly brackets ‘{’ and ‘}’ and every element separated by commas. Subset: The set A called a […]