McQ Automata Unit-1.pdf - Finite Automata Theory Questions and Answers Sanfoundry Automata Theory Questions and Answers \u2013 Finite This set of Automata

# McQ Automata Unit-1.pdf - Finite Automata Theory Questions...

This preview shows page 1 - 3 out of 61 pages.

8/27/2019Finite Automata Theory Questions and Answers - Sanfoundry1/3Automata Theory Questions and Answers – Finite Automata-IntroductionThis set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “FiniteAutomata-Introduction”.1. Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________a) reflexiveb) transitivec) symmetricd) reflexive and transitiveView AnswerAnswer: dExplanation: A partially ordered relation refers to one which is Reflexive, Transitive and Antisymmetric.advertisement2. The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | wherestring s contains even number of 0 and 13. A regular language over an alphabet ∑ is one that cannot be obtained from the basic languagesusing the operation4. Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be itsstates; Statement 3: The edges or arcs can be used for transitionsHint: Nodes and Edges are for trees and forests too.
8/27/2019Finite Automata Theory Questions and Answers - Sanfoundry2/3Which of the following make the correct combination?5. The minimum number of states required to recognize an octal number divisible by 3 are/isa) 1b) 3c) 5d) 7View AnswerAnswer: bExplanation: According to the question, minimum of 3 states are required to recognize an octal numberdivisible by 3.advertisement6. Which of the following is a not a part of 5-tuple finite automata?

#### You've reached the end of your free preview.

Want to read all 61 pages?

• Spring '19
• SOLUTIONS, Formal language, Regular expression, Nondeterministic finite state machine, Automata theory, Automata Theory Questions