Theory Of Computation MCQ - Regular languages and finite automata

6:

A finite state machine with the following state table has a single input x and a single output z. If initial state is unknown, then shortest input sequence to reach the inal state C is

 Present state Next state, z X = 1 X =0 A D, 0 B, 0 B B, 1 C, 1 C B, 0 D, 1 D B, 1 C, 0

 A. 01 B. 10 C. 110 D. 110 Answer Report Discuss Option: B Explanation : Click on Discuss to view users comments. POONAM RANI said: (2:14am on Saturday 11th February 2017) Incompletely automata bcz initial state is unknown Write your comments here:
7:

An FSM can be used to add how many given integers ?

 A. 1 B. 3 C. 4 D. 2 Answer Report Discuss Option: D Explanation : Finite Automata (FA) or Finite State Machine to add two integers can be constructed using two states: q0: Start state to represent carry bit is 0 q1: State to represent carry bit is 1 Click on Discuss to view users comments. yogi said: (8:38pm on Tuesday 29th January 2013) how to say 3 integer shivangi said: (4:13pm on Friday 14th February 2014) How to say 3? Write your comments here:
8:

If two finite state machines are equivalent, they should have the same number of

 A. states B. edges C. states and edges D. none of these Answer Report Discuss Option: D Explanation : Click on Discuss to view users comments. Write your comments here:
9:

For which of the following applications regular expressions can be used ?

 A. Designing compilers B. Developing text editors C. Simulating sequential circuits D. All of these Answer Report Discuss Option: D Explanation : Click on Discuss to view users comments. Write your comments here:
10:

L = {aP | p ; }  is prime is

 A. regular B. not regular C. accepted by DFA D. accepted by PDA Answer Report Discuss Option: B Explanation : Click on Discuss to view users comments. Write your comments here:

Syllabus covered in this section is-

• Regular languages and finite automata
• Context free languages and Push-down automata
• Recursively enumerable sets and Turing machines
• Undecidability, NPcompleteness
• Models of computation-Finite Automata
• Pushdown Automata
• Non-detenninism and NFA. DPDA and PDAs and Languages accepted by these Structures
• Grammars, Languages,
• Non- computability and Examples of non-computable problems

This Section covers Theory of Computation Questions Answers .These questions can be used for the preparation of various competitive and academic exams like

• UGC NET Computer Science
• Pre PhD Entrance Exam
• DOEACC Exams
• Kendriya Vidyalaya Sangathan Entrance Exam
• GATE Computer Science
• Post Graduate Computer Science Test
•  PhD Entrance Exam
• Computer Engineering
• National Eligibility Test (NET)
• State Eligibility Test (SET)

Who can benefit

• Theory of Computation Objective Questions Answers can be used by any student who is preparing for PhD entrance exam, pre PhD entrance exam, entrance exam or any other such exam.
• Any student who is preparing for DOEACC exams can also use Theory of Computation questions answers for preparation of his exams.
• Automata Theory mcq can be useful for the students who are pursuing any undergraduate or post graduate degree in computer science like BE, ME , Btech, Mtech, .BSc, MSc, BCA, MCA, BS, MS  or any other such degree
• Theory of Computation mcq with answers and explanation can also be useful for the students who are preparing for any competitive exam or recruitment exams like GATE Computer Science, UGC NET Computer Science, Kendriya Vidyalaya Sangathan PGT exam, PSU, IES or any other such exam.
• Theory of Computation multiple choice questions answers can also be used by any candidate who wants to gain credits in Theory of Computation in BS Computer science or MS Computer science.
• Theory of Computation mcq questions answers can be used for the preparation of National Eligibility Test (NET) and State Eligibility Test (SET).
• You can download Theory of Computation mcq pdf from this site.

Various Search Terms Used For This Section Are