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: | Tezuru Zulkit |

Country: | Madagascar |

Language: | English (Spanish) |

Genre: | Literature |

Published (Last): | 11 May 2009 |

Pages: | 17 |

PDF File Size: | 20.70 Mb |

ePub File Size: | 17.42 Mb |

ISBN: | 334-7-87331-724-9 |

Downloads: | 33153 |

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

Uploader: | Shakall |

The height of the parse tree is the length of the longest path from the root to some leaf. What are the applications of Regular expressions and Finite automata Lexical analyzers and Text editors are two applications.

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

P n-1 is called the induction hypothesis. Q s a finite set of states. They are similar to recursive languages qnswers they are computed by TM that always halt. Context free languages are used in:. Find out the CFL.

### CS theory of Computation easy way to pass,tips to clear TOC | 5 STAR NOTES

When we say a problem is decidable? Give an example of undecidable. Computer scientists describes the programming languages by a notation called Backus- Naur Form. Let L be any CFL. The halting problem for TMs is: Although the voltages assume infinite set of values,the electronic circuitry is designed so that the voltages orresponding to 0 or 1 comlutation stableand all others adjust to these value.

Universal TMs are TMs that can be programmed to solve any problem, that can be solved by any Turing machine. In one move ,TM depending upon the symbol scanned by the tape head and state of the finite control:.

Give examples of recursive languages? A problem whose language is recursive is said to be decidable. An automaton in whch the output depends on the transition and current input is called Mealy machine. All combinations with the pattern Simplified the definition of programming languages.

## ‘+relatedpoststitle+’

What is canonical ordering? The tape head moves to the rightrepeatedly storing the symbols in the FC and replacing the symbols read from the cells to the left. The TM can then return to the vacated cells and prints symbols. TM has unlimited and unrestricted memory and is a much more accurate model of a general purpose computer.

Finite Automata is used to model regular expression and cannot be used to represent non regular languages. Then the principle of mathematical induction is that P n follows from. CFL are not closed under intersectioncomplementation. A function f i1,…ik computed by a Turing machine is called a partial recursive function. Automaton is a abstact computing device. Checking off symbols is useful method when a TM recognizes a language with repeated strings and also to compare the comphtation of substrings.

Apart from the halt statea given TM is total. Hence B is useless symbol and remove B from all productions. TM can accept the string by entering accepting state.

Deterministic Finite Automaton is a FA in computatioh there is only one path for a specific input from current state to next state. Otherwise the problem is said to be undecidable.