Which of the following is an application of Finite Automaton a Compiler Design

Which of the following is an application of finite

This preview shows page 51 - 55 out of 61 pages.

3. Which of the following is an application of Finite Automaton?a) Compiler Designb) Grammar Parsersc) Text Searchd) All of the mentionedView AnswerAnswer: dExplanation: There are many applications of finite automata, mainly in the field of Compiler Design andParsers and Search Engines.
Background image
8/27/2019Equivalence of NFA & DFA - Automata Theory Questions and Answers - Sanfoundry2/44. John is asked to make an automaton which accepts a given string for all the occurrence of ‘1001’ init. How many number of transitions would John use such that, the string processing application works?advertisement5. Which of the following do we use to form an NFA from a regular expression?6. Which among the following can be an example of application of finite state machine(FSM)?7. Which among the following is not an application of FSM?a) Lexical Analyserb) BOT
Background image
8/27/2019Equivalence of NFA & DFA - Automata Theory Questions and Answers - Sanfoundry3/4c) State chartsd) None of the mentionedView AnswerAnswer: dExplanation: Finite state automation is used in Lexical Analyser, Computer BOT (used in games), Statecharts, etc.advertisement8. L1= {w | w does not contain the string tr }L2= {w | w does contain the string tr}Given ∑= {t, r}, The difference of the minimum number of states required to form L1 and L2?9. Predict the number of transitions required to automate the following language using only 3 states:L= {w | w ends with 00}
Background image
8/27/2019Equivalence of NFA & DFA - Automata Theory Questions and Answers - Sanfoundry4/4
Background image
Image of page 55

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture