MCQPDF.pdf - UNIT-I FINITE AUTOMATA 1 2 3 4 Analytically a finite automaton can be represented by a a 6 b 4 c 5 d 7 Final state(s may not be a part of

MCQPDF.pdf - UNIT-I FINITE AUTOMATA 1 2 3 4 Analytically a...

This preview shows page 1 - 4 out of 100 pages.

UNIT-I: FINITE AUTOMATA 1. Analytically, a finite automaton can be represented by a__ tuples: c 5 2. Final state(s) may not be a part of the given states of a finite automaton. 3. Transition Systems is the other name given to: 4. Implicitly, 6(q,4) = 5. For any transition function 6 and for any two input strings x and y, 6(q, xy) = 6. DFA stands for: 7. The function Z(t) = A(q({t), x(t)) represents: 8. The function Z(t) = A(q(t)) represents:
Background image
9. Ina transition table, initial state is depicted by which of the following symbol? Arrow pointing to a state(>) Circle over a state Concentric circles over a state Underlined state 10. NDFA stands for: Non-Deterministic Final Automata Non-Finite Deterministic Automata Non-Deterministic Finite Automata Non-Determined Finite Automata 11. Final state in a Transition Diagram is depicted by: Arrow pointing to a state(>) Circle over a state Concentric circles over a state Underlined state 12. Minimization of Finite automata means: Converting an NDFA into a DFA Reducing number of states in a finite automata Creating finite automata with minimum number of final states Reducing number of transitions in a finite automata Answer keys: Unit-| No Toon 4. a 7. C 5. d 8. a 6. d 9 a 10. c Ti.c 12. b
Background image
UNIT-Il: REGULAR EXPRESSIONS AND REGULAR SETS 1. Machine format of Regular Expression is 2. Regular Expression is accepted by 3. The language of all words with atleast2 a's can be described by the Regular Expression a{ab)*a (a + b)*ab*a(a + b)* b*ab*a(a + b)* All of the above qaooa0m 4. Which type of language is Regular Expression? 5. Which of the following Regular Expression over {0,1} denotes set of all strings not containing 100 as substring?
Background image
Image of page 4

You've reached the end of your free preview.

Want to read all 100 pages?

  • Winter '18
  • Mr.Puneet Kumar Kaushal
  • Formal language, Regular expression, Nondeterministic finite state machine, Automata theory, finite automata

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture