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: Nimuro Nikora
Country: Monaco
Language: English (Spanish)
Genre: Business
Published (Last): 1 January 2010
Pages: 479
PDF File Size: 1.55 Mb
ePub File Size: 18.43 Mb
ISBN: 493-3-35381-309-8
Downloads: 79471
Price: Free* [*Free Regsitration Required]
Uploader: Talar

It can enter an infinite loop so that it never halts.

All combinations with the pattern Apart from the halt statea given TM is total. What are the different types of language acceptances by a PDA and define them. What are the concepts used in UTMs?

NFA or Non Deterministic Finite Automaton is the one in which there exists many paths for a specific input from current state to next state. Xk respectively then A X1X2…. The regular sets are closed under union, concatenation and Kleene closure.


The diagonalization language consists of all strings w such that the TM M. The label of the root may not be the start symbol of the grammar. Language is a set of valid strings from some alphabet. In one move, the heads may each move independently left or vank or remain stationary. The universal language consists of a set of binary strings in the form of. Find out the CFL.

CS Theory of computation RJ edition 2 and 16 marks with answers -Unit wise

In a multi-tape TM ,one tape acts as an output tape, on which a symbol, once written can never be changed and whose tape head never moves left. What properties of r.

The set may be empty,finite or infinite. M is a DFSM that. Let L be any CFL. Thus to model a context free language, a Pushdown Automata is used. Thus reg exp identifies token in a language.

There are no transitions from any of the halt states of any given TM. FA accepts a string x if the sequence of transitions corresponding to the symbols of x leads from the start state to accepting state. Grammar or regular expression Generative approach Automaton Recognition approach.


What are the applications of Regular expressions and Finite automata Lexical analyzers and Text editors are two applications. What is the crucial assumptions for encoding a TM? What are the three ways to simplify a context free grammar?

This problem is undecidable as there is no algorithm to solve this problem. TM has unlimited and unrestricted memory and is a much more accurate model of a general purpose computer. The heads are numbered 1 through k, and move of the TM depends on the state and on the symbol scanned by each head. Decidable problems have an.


A language is regular if it is accepted by some finite automaton. Consider the ambiguity problem for CFGs. What are the components of Finite automaton model? A specific Universal Turing machine U is:.