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: | Arashizragore Yozshut |

Country: | Great Britain |

Language: | English (Spanish) |

Genre: | Environment |

Published (Last): | 8 October 2016 |

Pages: | 181 |

PDF File Size: | 20.31 Mb |

ePub File Size: | 11.23 Mb |

ISBN: | 390-6-81503-221-6 |

Downloads: | 18365 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Tygogar |

Interpretive Implementation of Programming languages. Decidable problems have an.

How can a TM acts as a generating device? The regular sets are closed under union, concatenation and Kleene closure. Ccs2303 most obvious way to do iwth is to treat the entire nonblank portion of the initial tape as inputand to treat the entire blank portion of the tape when the machine halts as output. We can describe TM using:. The finite control FC stores a limited amount of information. A TM can be used as a transducer.

This is an intermediate form in doing a derivation. The notion of computable function can be identified with the class of partial recursive functions is known as Church-hypothesis or Church-Turing thesis.

## ‘+relatedpoststitle+’

The diagonalization language consists of all strings w such that the TM M. In a multi-tape TM ,one tape acts as an output tape, on which a symbol, once wth can never be changed and whose tape head never moves left. The universal language consists of a set of binary strings bankk the form of.

Is it true that the language accepted by a PDA by empty stack and final states are different languages.

Any computation that can be done by 2-way infinite tape can also be done by standard TM. Depending on the current state and input symbol read from the input tape it changes state.

So we require a PDA ,a machine that can count without limit.

On a single move depending on the state of finite control and symbol scanned by each of tape heads ,the machine can change state print a new symbol on each cells scanned by tape head, move each of its tape head independently one cell to the left or right or remain stationary. Let R be any set of regular languages.

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

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 Coputation or an error message indicating that w is not a sentence of G. The languages that is accepted by TM is said to be recursively computaation r. What is the basic difference between 2-way FA and TM?

Transition diagram is a directed graph in which the vertices of the graph correspond to the states of FA. Why are switching circuits called as finite state systems? Pumping lemma is used to check if a language is regular or not. What is a total recursive function and b partial recursive function. There are no auestion from any of the halt states of any given TM.

Find the language generated by: V and T are disjoint. Write examples with diagrams. What are the applications of Context free languages. In 2-way infinite tape TM, the tape is infinite in both directions. The class of regular sets are closed compuration complementation, substitution, homomorphism and inverse homomorphism. What are the three ways to simplify a context free grammar? Remove the empty production. A k-head TM has some k heads.

Bznk label of the root may not be the start symbol of the grammar. This problem is undecidable as there is no algorithm to solve this problem. The pumping lemma can be used to prove a variety of languages are not context free. What are the components of Finite automaton model? Computer scientists describes the programming languages by a notation called Backus- Naur Form. Nothe language accepted by non-deterministic Turing machine is same as recursively enumerable language.

Otherwise the problem is said to be undecidable.

Thus to model a context free language, a Pushdown Automata is used. L is recursively enumerable iff satisfies the following properties:. These are programs used for processing the text. Then the principle of mathematical induction is that P n follows from. What are the applications of Regular expressions cmputation Finite automata Lexical analyzers and Text editors are two applications.