Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 432 views

    Automata Theory Questions and Answers - Finite Automata: GJHGHJ

    Uploaded by

    Kamalakar Sreevatasala
    This document provides 15 multiple choice questions about finite automata. Some key points covered include: - There are 5 tuples in a finite state machine: states, input symbols, initial state, accepting state, and transition function. - The transition function maps states and input strings to an output state. - A minimal finite automaton with 3 states is required to accept strings that end with "10". - The language of a finite automaton is the set of strings that are accepted by the automaton. - Finite automata have limitations in that they cannot remember arbitrary large amounts of information like pushdown automata or Turing machines.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Automata Theory Questions and Answers - Finite Automata: GJHGHJ

    Uploaded by

    Kamalakar Sreevatasala
    432 views5 pages
    This document provides 15 multiple choice questions about finite automata. Some key points covered include: - There are 5 tuples in a finite state machine: states, input symbols, initial state, accepting state, and transition function. - The transition function maps states and input strings to an output state. - A minimal finite automaton with 3 states is required to accept strings that end with "10". - The language of a finite automaton is the set of strings that are accepted by the automaton. - Finite automata have limitations in that they cannot remember arbitrary large amounts of information like pushdown automata or Turing machines.

    Original Description:

    theory of automata

    Original Title

    Toa

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides 15 multiple choice questions about finite automata. Some key points covered include: - There are 5 tuples in a finite state machine: states, input symbols, initial state, accepting state, and transition function. - The transition function maps states and input strings to an output state. - A minimal finite automaton with 3 states is required to accept strings that end with "10". - The language of a finite automaton is the set of strings that are accepted by the automaton. - Finite automata have limitations in that they cannot remember arbitrary large amounts of information like pushdown automata or Turing machines.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    432 views5 pages

    Automata Theory Questions and Answers - Finite Automata: GJHGHJ

    Uploaded by

    Kamalakar Sreevatasala
    This document provides 15 multiple choice questions about finite automata. Some key points covered include: - There are 5 tuples in a finite state machine: states, input symbols, initial state, accepting state, and transition function. - The transition function maps states and input strings to an output state. - A minimal finite automaton with 3 states is required to accept strings that end with "10". - The language of a finite automaton is the set of strings that are accepted by the automaton. - Finite automata have limitations in that they cannot remember arbitrary large amounts of information like pushdown automata or Turing machines.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 5

    Gjhghj

    Automata Theory Questions and Answers Finite Automata


    This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
    Regular Language & Expression.

    1. There are ________ tuples in finite state machine.


    a) 4
    b) 5
    c) 6
    d) unlimited
    View Answer
    Answer:b
    Explanation: states,input symbols,initial state,accepting state and transition function.
    2. Transition function maps.
    a) * Q ->
    b) Q * Q ->
    c) * -> Q
    d) Q * -> Q
    View Answer
    Answer:d
    Explanation: Inputs are state and input string output is states.
    3. Number of states require to accept string ends with 10.
    a) 3
    b) 2
    c) 1
    d) cant be represented.
    View Answer
    Answer:a
    Explanation: This is minimal finite automata.
    4. Extended transition function is .
    a) Q * * -> Q
    b) Q * -> Q
    c) Q* * * ->
    d) Q * ->
    View Answer
    Answer:a
    Explanation: This takes single state and string of input to produce a state.
    5. *(q,ya) is equivalent to .
    a) ((q,y),a)
    b) (*(q,y),a)
    c) (q,ya)
    d) independent from notation
    View Answer
    Answer:b
    Explanation: First it parse y string after that it parse a.
    6. String X is accepted by finite automata if .
    a) *(q,x) E A
    b) (q,x) E A
    c) *(Q0,x) E A
    d) (Q0,x) E A
    View Answer
    Answer:c
    Explanation: If automata starts with starting state and after finite moves if reaches to final step then it
    called accepted.
    7. Languages of a automata is
    a) If it is accepted by automata
    b) If it halts
    c) If automata touch final state in its life time
    d) All language are language of automata
    View Answer
    Answer:a
    Explanation: If a string accepted by automata it is called language of automata.
    8. Language of finite automata is.
    a) Type 0
    b) Type 1
    c) Type 2
    d) Type 3
    View Answer
    Answer:d
    Explanation: According to Chomsky classification.
    9. Finite automata requires minimum _______ number of stacks.
    a) 1
    b) 0
    c) 2
    d) None of the mentioned
    View Answer
    Answer:b
    Explanation: Finite automata doesnt require any stack operation .
    10. Number of final state require to accept in minimal finite automata.
    a) 1
    b) 2
    c) 3
    d) None of the mentioned
    View Answer
    Answer:d
    Explanation: No final state requires.
    11. Regular expression for all strings starts with ab and ends with bba is.
    a) aba*b*bba
    b) ab(ab)*bba
    c) ab(a+b)*bba
    d) All of the mentioned
    View Answer
    Answer:c
    Explanation: Starts with ab then any number of a or b and ends with bba.
    12. How many DFAs exits with two states over input alphabet {0,1} ?
    a) 16
    b) 26
    c) 32
    d) 64
    View Answer
    Answer:d
    Explanation: Number of DFAs = 2^n * n^(2*n).
    13. The basic limitation of finite automata is that
    a) It cant remember arbitrary large amount of information.
    b) It sometimes recognize grammar that are not regular.
    c) It sometimes fails to recognize regular grammar.
    d) All of the mentioned
    View Answer
    Answer:a
    Explanation:Because there is no memory associated with automata.
    14. Number of states require to simulate a computer with memory capable of storing 3
    words each of length 8.
    a) 3 * 2^8
    b) 2^(3*8)
    c) 2^(3+8)
    d) None of the mentioned
    View Answer
    Answer:b
    Explanation: 2^(m*n) states requires .
    15. FSM with output capability can be used to add two given integer in binary
    representation. This is
    a) True
    b) False
    c) May be true
    d) None of the mentioned
    View Answer
    Answer:a
    Explanation: Use them as a flip flop output .

    You might also like