Theory of computation (TOC) (CS) (CS) (CS53) ( CS) Question Bank 1 (old) – View Question Bank 2 (old) – View / Download Question bank. Anna University Department of computer science engg Fifth Semester CS theory of computation (Regulation ) Semester: 5. Third Year CSE(Sem:V) 2 marks Questions and Answers NFA can be used in theory of computation because they are more flexible and easier to use than.

Author: Zolojora Moogull
Country: Peru
Language: English (Spanish)
Genre: Photos
Published (Last): 4 June 2018
Pages: 73
PDF File Size: 17.48 Mb
ePub File Size: 7.39 Mb
ISBN: 761-3-58813-764-9
Downloads: 74509
Price: Free* [*Free Regsitration Required]
Uploader: Tonris

Deterministic Finite Automaton is a FA in which there is only one path for a specific input from current state to next state. Then L is not a regular language. What are the different types of language acceptances by a PDA and define them. Thus to model a context free language, a Pushdown Automata is used. Consider the ambiguity problem for CFGs. It can reject the string by entering non-accepting state.

In one move ,TM depending upon the symbol scanned by o tape head and quesiton of the finite control:.


When we say a problem is decidable? This is an intermediate form in doing a derivation.

Turing machine is a simple mathematical model of a computer. A parser for grammar G is a program that takes as input a string w and produces as output either a parse tree for w ,if w is a sentence of G or an error message indicating that w is not a sentence of Answesr. Give examples of decidable problems. A Turing machine can make space on its tape by shifting all nonblank symbols a finite number of cells to the right.


Compufation the problem is said to be undecidable. Depending on the current state and input symbol read from the input tape it changes state.

This hierarchy is called as Chomsky Hierarchy. The class of r.

Each variable and each terminal of G appears in the derivation of some word in L. Apart from the halt statea given TM is total. V and T are disjoint. Let R be any set of regular languages. A language L is recursively answwrs if there is a TM that accepts L and. The notion of computable function can be identified with the class of partial recursive functions is known as Church-hypothesis or Church-Turing thesis. Context free languages are used in:. M is a DFSM that. All common arithmetic functions on integers such as multiplicationn!

Thus reg exp identifies token in a language. This problem is undecidable as there is no algorithm to solve this problem. A lexical analyzer scans the symbols of a program to questioon strings corresponding to identifiers, constants etc, and it has to remember limited amount of information. P n-1 is called the induction hypothesis.


CS theory of Computation easy way to pass,tips to clear TOC | 5 STAR NOTES

In one move, the heads may each move independently left or right or remain stationary. These are programs used for processing the text.

It can enter an infinite wjth so that it never halts. They are similar to r.

The tokens of the programming language can be expressed using regular expressions. The move dependent on the input symbol a scanned is:. Hence B is useless symbol and remove B from all productions.

The languages that is accepted by TM is said to be recursively enumerable r. Simplified the definition of programming languages. TOC suggests various abstract models of computation, represented mathematically.

Author: admin