NPTEL >> Courses >> Computer Science and Engineering >> Theory of Automata, Formal Languages and Computation (Video) >> FINAL STATE AUTOMATA
Question in Lecture
 Ask a Question Question Topics : Question:     Max: 300 char

All Questions

 Question: All the language accepting devices that I have learnt: FSA, PDA and TM consists of finite number of states. Is it possible to have a machine consisting of infinite number of states, if so what will be its characteristics and what kind of language will it accept? Thank you By: Hindol     Date: 2012-02-05 Answer: Generally we allow only a finite number of states. Even the most general machine, Turing machine which is called an infinite automaton has only a finite number of states but an infinite tape meaning you can extend the tape to the extent you want. By: Prof. Kamala Krithivasan     Date: 2012-03-14

 Question: Respected Mam , If i will add one more Input Tape(ie Finite Automata with more than one Input Tape)then what will be the Effect on this on the power of Finite Automata By: Pradeep Kumar Dubey     Date: 2012-06-20 Answer: Same Multi tape finite automata are equivalent to single tape automata. But definition has to be given properly. By: Prof. Kamala Krithivasan     Date: 2012-07-07

 Question: Respected Mam , If i will add one more Read only Head(ie Finite Automata with more than one Read Only Head)then what will be the Effect on this on the power of Finite Automata ? By: Pradeep Kumar Dubey     Date: 2012-06-20 Answer: Power will increase. Multi head automata are more powerful than FSA. For example, apowern bpowern can be accepted. By: Prof. Kamala Krithivasan     Date: 2012-07-07

 Question: Which of the following statements is true: A) Determinstic Finite Automata is more powerful than non-deterministic finite automata. B) Non-deterministic Finite automata is more powerful than deterministic finite automata. C) Finite automata doesn't have memory. D) Finite automata cannot acce By: shyju     Date: 2012-11-16 Answer: question 4thpart is incomplete By: Prof. Kamala Krithivasan     Date: 2013-05-28

 Question: The empty language is denoted by ∅. can we call the symbol ∅ as pie? is it Greek letter? By: NAVEENKUMAR M     Date: 2013-01-23 Answer: phi. It is a greek letter. different from pie or symbol used in the area of a circle By: Prof. Kamala Krithivasan     Date: 2013-05-28
 Disclaimer: We will take every effort to answer your question.However, in case of delay or no response NPTEL claims no responsibility. Site Maintained by Web Studio, IIT Madras. Contact Webmaster: nptel@iitm.ac.in