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: Shasar Kazibar
Country: Lithuania
Language: English (Spanish)
Genre: Love
Published (Last): 9 December 2014
Pages: 99
PDF File Size: 6.73 Mb
ePub File Size: 2.28 Mb
ISBN: 905-5-99039-497-1
Downloads: 40832
Price: Free* [*Free Regsitration Required]
Uploader: Dami

The halting problem for TMs is: Remove the empty production. The set of finite languages in is enumaerable. There are no transitions from any of the halt states of any given TM. A k-head TM has some k heads.

Why are switching circuits called as finite state systems? Decidable problems have an. V and T are disjoint. What are the components of Finite automaton model? Transition diagram is a directed graph in which the vertices of the graph correspond to the states of FA. A special case of FA is Moore machine in which the output depends on the state of the machine. The class of regular sets are closed under complementation, substitution, homomorphism and inverse homomorphism.


Then L is not a regular language. What are the conditions for L to be r.

Depending on the current state and input symbol read from the input tape it changes state. For eg identifier can be expressed as a regular expression. Let L be any CFL.


The regular sets are closed under union, concatenation and Kleene closure. The input string is accepted by the PDA if:. CFL are not qurstion under intersectioncomplementation.

There is a unique transition on each input symbol. Pumping lemma is used to check if a language is regular if not. What is the main application of pumping lemma in CFLs? The grammar has the production P as:. What are the concepts used in UTMs?


The components of FA model are Input tape, Read control and finite control. What is canonical ordering? Turing machine can change symbols on its tapewhereas the FA cannot change symbols on tape. Is it true that the language accepted by a non-deterministic Turing machine is different from recursively enumerable language?


Thus to model a context free language, a Pushdown Automata is used. What are the possibilities of a TM when processing an input questiob Finally the productions are: In one move ,TM depending answerss the symbol scanned by the tape head and state of the finite control:.

What is the basic difference between 2-way FA and TM?

All common arithmetic functions on integers such as multiplicationn! Text editors and lexical analyzers are designed as finite state systems. The clmputation notations for specifying formal languages are: A TM can be used as a transducer.