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: | Vudozragore Turan |
| Country: | Indonesia |
| Language: | English (Spanish) |
| Genre: | Technology |
| Published (Last): | 7 April 2010 |
| Pages: | 116 |
| PDF File Size: | 14.6 Mb |
| ePub File Size: | 13.1 Mb |
| ISBN: | 638-6-54803-394-4 |
| Downloads: | 85602 |
| Price: | Free* [*Free Regsitration Required] |
| Uploader: | Vogis |
‘+relatedpoststitle+’
Depending on the current state and input symbol read from the input tape it changes state. Finally the productions are: Otherwise the problem is said to be undecidable. Give an example of undecidable.

Let L be a CFL. The set of finite languages in is answera. It can enter an infinite loop so that it never halts.
What is the basic difference between 2-way FA and TM? All common arithmetic functions on integers such as multiplicationn!
CS Theory of computation RJ edition 2 and 16 marks with answers -Unit wise
A function nank i1,…ik computed by a Turing machine is called a partial recursive function. A Turing machine can make space on its tape by shifting all nonblank symbols a finite number of cells to the right. Then L is not a regular language.
What is a universal language Lu?

When we say a problem is decidable? Transition Diagram associated with DFA is a directed graph whose vertices corresponds to states of DFA, The edges are the transitions from one state to another.
Condition i is called the basis step and condition ii is called the inductive step. The leftmost fomputation is not distinguished. What are the techniques for Turing machine construction?
Consider the ambiguity problem for CFGs. Although the voltages assume infinite set of values,the electronic circuitry is designed so that the voltages orresponding to 0 or 1 are stableand all others adjust to these value.
C2303 and T are disjoint. What are the applications of Regular expressions and Finite automata Lexical tneory and Text editors are two applications. Turing machine can change symbols on its tapewhereas the FA cannot change symbols on tape.
SEM 5 QUESTION BANK – CSE TUBE
Why are switching circuits called as finite state systems? Given any TM M and an input string w, does M halt on w? TOC suggests various abstract models of computation, represented mathematically. The regular sets are closed under union, concatenation and Kleene closure. The Turing machine is equivalent in computing power to the digital computer.
Finite Automata is used to model regular expression and cannot be used to answrs non regular languages. The two notations for specifying formal languages are: This hierarchy is called as Chomsky Hierarchy. P n-1 is called the induction cd2303. Thus control unit of a computer is a finite statesystem.
The TM can then return to the vacated cells and prints symbols. The notion of computable function can be identified with the class of partial recursive functions is known as Church-hypothesis or Church-Turing thesis.
What are the three ways to simplify a context free grammar?
