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: | Akinoran Brajin |

Country: | Tunisia |

Language: | English (Spanish) |

Genre: | Love |

Published (Last): | 11 January 2014 |

Pages: | 392 |

PDF File Size: | 20.70 Mb |

ePub File Size: | 6.12 Mb |

ISBN: | 621-6-22437-965-1 |

Downloads: | 21173 |

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

Uploader: | Akigrel |

A special case of FA is Moore machine in which the output depends on the state of the machine. In one move ,TM depending upon the symbol scanned by the tape head and state of the finite control:. The TM can then return to hheory vacated cells and prints symbols.

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

There is a unique transition on each input symbol. On a single move depending on the state of finite control and symbol scanned by each of quwstion 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.

The label of the root may not be the start symbol of the grammar. State the halting problem of TMs.

### Theory of Computation – TOC – Computer Science- Anna University – Question bank – CS

Otherwise the problem is said to be undecidable. TM can accept the string by entering accepting state. What are the applications of Context free languages.

What is the main application of pumping lemma in CFLs? State the equivalence of acceptance by final state and empty stack. Grammar or regular expression Generative approach Automaton Recognition approach. CFL cimputation closed under substitutionhomomorphism. Is it true that the language accepted by a Oof by empty stack and final states are different languages.

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.

It has an infinite tape divided into cells ,each cell holding one symbol. What is a total recursive function and b partial recursive function. Let L be any CFL. The universal language consists of a set of binary strings in the form of. Turing machine can change symbols on its tapewhereas the FA cannot change symbols on tape. The left move is: Although the voltages assume answesr 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.

All common arithmetic functions on integers anxwers as multiplicationn! That is a G string is in L G if:. The tape head moves to the rightrepeatedly storing the symbols in the FC and replacing the symbols read from questiion cells to the left. All combinations with the pattern Let P n be a ststement about a non negative integer n.

## ‘+relatedpoststitle+’

ID describe the configuration of a PDA at a given instant. This is a context free grammar notation with minor changes in format and some shorthand. Depending on the state cs23303 symbol scannedthe device changes stateprints a new symbol and moves its tapehead in one of the 2k directions, either positively or negatively ,along one of the k-axes.

When we say a problem is decidable? A sentential thwory is a string containing a mix of variables and terminal symbols or all variables. In one move, the heads may each move independently left or right or remain stationary. They are similar to r.

Text editors and lexical analyzers are designed as finite state systems. A regular expression is a string that describes the whole lf of strings according to certain syntax rules. What is a universal language Lu?

Then L is not a regular language. P n-1 is called the induction hypothesis. What are the applications of Regular expressions and Finite automata Lexical analyzers and Text editors are two applications. The two notations for specifying formal languages are: The regular expression R is given as: Why are switching circuits called as finite state systems?

The tokens of the programming language can be expressed using regular expressions. Xk respectively then A X1X2…. The state of the Finite control represents the state and the second element represent a symbol scanned. A specific Universal Turing machine U is:. The heads are numbered 1 through k, and move of the TM depends on the state and on the symbol scanned by each head.

FA accepts a string x if the sequence of transitions corresponding to the symbols of x leads from the start state to accepting state. Language is a set of valid strings from some alphabet. So we require a PDA ,a machine that can count without limit. This is an intermediate form in doing a derivation.