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.
||20 December 2006
|PDF File Size:
|ePub File Size:
||Free* [*Free Regsitration Required]
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. Let R be any set of regular languages. They are similar to recursive languages as they are computed by TM that always halt. annswers
CS THEORY OF COMPUTATION-QUESTION BANK WITH ANWSERS- 2MARKS
TM can be used as:. TOC suggests various abstract models of computation, represented mathematically. A sentential form is a string containing a mix of variables and terminal symbols or all variables. When we say a problem is decidable?
Each variable and each terminal of G appears in the derivation of some word in L.
Remove the empty production. Checking off symbols is useful method when a TM recognizes a language with repeated strings and also to compare the length of substrings. What are the conditions for L to be r.
A switching circuit consists of a finite number of gates, each of which can be in any one of the two conditions 0 or 1. What are the components of Finite automaton model? The regular expression R is given as: Universal TMs are TMs that can be programmed to solve any problem, that can be solved by any Turing machine. TM can accept the string by entering accepting state.
The languages that is accepted by TM is said to bahk recursively enumerable r. The lexical analyzer scans the input program and separates the tokens. Simplified the definition of programming languages. There are no transitions from any of the halt states of any given TM.
State the equivalence of acceptance by final state and empty stack. When a recursively enumerable language is said to be recursive?
For eg identifier can be expressed as a regular expression. CFL are closed under union, concatenation and Kleene closure. The two notations for specifying formal languages are: Condition i is called the basis step and condition ii is called the inductive step. The TM can then return to the vacated cells and prints symbols.
Is it true that the language accepted by a non-deterministic Turing machine is different from recursively enumerable language? The input string is accepted by the PDA if:. Decidable problems have an.
The diagonalization language consists of all strings w such that the TM M. Nothe language accepted by non-deterministic Turing machine is same as recursively enumerable language. In one move ,TM depending upon the symbol scanned by the tape head and state of the finite control:. It has an computatipn tape divided into cells ,each cell holding one symbol. Given any TM M and an input string w, does M halt on w?
Depending on the current state and input symbol read from the input tape it changes state. A sentence is a string of terminal symbols. Turing machine can change symbols on its tapewhereas the FA cannot change off on tape. Why are switching circuits called as finite state systems? P n-1 is called the induction hypothesis. The language accepted by M is: A language is regular if it is accepted by some finite automaton. The left move is: Then L is not a regular language. Describes block structure in programming languages.
All combinations with the pattern Otherwise the problem is said to be undecidable. What are the concepts used in UTMs? What are the techniques for Turing machine construction? What is the basic difference between 2-way FA and TM? TOC describes the basic ideas and models underlying computing. F is the set of final states.