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: | Vidal Yojinn |

Country: | Panama |

Language: | English (Spanish) |

Genre: | Spiritual |

Published (Last): | 22 April 2007 |

Pages: | 185 |

PDF File Size: | 19.84 Mb |

ePub File Size: | 2.91 Mb |

ISBN: | 823-1-98506-170-1 |

Downloads: | 24324 |

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

Uploader: | Fejind |

Prints a symbol on the tape cell scanned, replacing what was written there.

## ‘+relatedpoststitle+’

Xk must be in P. Apart from the halt statea given TM is total. That is a G string is in L G if:.

Xk respectively then A X1X2…. State the equivalence of acceptance by final state and empty stack. A TM can be used as a transducer. Give examples of decidable problems. The diagonalization language consists of all strings w such that the TM M.

There is a unique transition on each input symbol. Condition i is called the basis step and condition ii is called the inductive step.

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

Describes block structure in programming languages. When a recursively enumerable language is said to be recursive? Universal TMs are Theofy that can be programmed to solve any problem, that can be solved by any Turing machine.

What is theiry Diagonalization language Ld? 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. Is it true that the language accepted by a non-deterministic Turing machine is different from recursively enumerable language?

When we say a problem is decidable? The TM can then return to the vacated cells and prints symbols. Then L is not a regular language.

F is the set of final states. A problem whose language is recursive is said to be decidable. A lexical analyzer scans the symbols of a program to locate strings corresponding to identifiers, constants etc, and it has to remember limited amount of information.

The left move is: Why are switching circuits called as finite state systems? The notion of computable function can be identified with the class of partial recursive functions is known as Church-hypothesis or Church-Turing thesis.

Depending on the current state and input symbol read from the input tape it changes state. Let L be any CFL. Remove the empty production.

It can enter an infinite loop so that it never halts. CFL are closed under union, concatenation and Kleene closure.

The move dependent on the input symbol a scanned is:. What properties of recursive enumerable seta are not decidable? Give an example of undecidable.

### CS THEORY OF COMPUTATION-QUESTION BANK WITH ANWSERS- 2MARKS

What is the crucial assumptions for encoding a TM? When is a trivial property? A sentence is a string of terminal symbols. The set may be empty,finite or infinite. What are the applications of Context free languages. Any computation that can be done by 2-way infinite tape can also be done by standard TM.

Finally the productions are: Text editors and lexical analyzers are designed as finite state systems. The state of the Finite control represents the state and the second element represent a symbol scanned.

Nothe language accepted by non-deterministic Turing machine is same as recursively enumerable language. For example UNIX text editors uses the reg cmputation for substituting the strings such as: Q s a finite set of states. A k-head TM has some k questioj. Thus control unit of a computer is a finite statesystem. The regular expression R is given as: Simplified the definition of programming languages. State the halting problem of TMs.