**1. What is a finite automaton?**

A) Machine with Infinite Memory

B) A finite memory machine DarkNonQuery

C) A Turing machine.

D) None of the above.

**Answer: B) A finite memory machine DarkNonQuery**

**2. Apart from what is a transition function in the case of finite automaton?**

A) Î´: Q Ã— Î£ â†’ Q

B) Î´: Q Ã— Î£ â†’ Î£

C) Î´: Q Ã— Î£ â†’ P(Q)

D) Î´: Î£ Ã— P(Q) â†’ Î£

**Answer: A) Î´: Q Ã— Î£ â†’ Q**

**3. For what class of automata, does there exist** a DFA such that both classes are expressively equal?

A) Regular languages

B) Context-free languages

C) Recursive languages

D) Turing-decidable languages

**Answer: A) Regular languages**

**4. What is Î£ in Automata Theory?**

A) Alphabet

B) State set

C) Transition function

D) Output function

**Answer: A) Alphabet**

**5. 2 namely 2. Automaton with a stack as memory structure is â€”**

A) DFA

B) NFA

C) PDA

D) LBA

**Answer: C) PDA**

**6. DFA vs NFA â€” what is the difference?**

A) DFA has multiple transitions for each input.

B) NFA has Transition which is non-deterministic.

C) DFA has no option for one input.

D) NFA accepts nonregular languages.

**Answer: C) DFA has no option for one input.**

**7. Is the language accepted by the Pushdown Automaton (PDA)**

A) Regular language

B) Context-free language

C) Context-sensitive language

D) Recursive language

**Answer: B) Context-free language**

**8. Definition of Transition in Turing Machine**

A)Symbol, State S i, Symbol

B) Input Symbol, Current State, Next state, Output Symbol, and Head Direction.

C) Symbol am input or state

D) None of the above

**Answer: B) Input Symbol, Current State, Next state, Output Symbol, and Head Direction.**

**9. which is Closed under Union**

A) Regular languages

B) Context-free languages

C) Recursive languages

**D) All of the above**

**10. Which machine can detect a context-sensitive Language**

A) DFA

B) NFA

C) LBA

D) Turing machine

**Answer: C) LBA**

**11. What is the length of time a Turing machine can continue to tick away?**

A) More than DFA

B) Less than PDA

C) Equivalent to LBA

D) Unlimited memory

**Answer: D) Unlimited memory**

**12. Which one is not a component of a finite automaton?**

A) Input alphabet

B) Output function

C) Set of states

D) Transition function

**Answer: B) Output function**

**13. The following properties are not the properties of deterministic pushdown automata (DPDA)**

A) No, as it accepts all context-free languages.

B) PDA is less powerful.

C) Deterministic transitions.

D) It does not accept non-context-free languages.

**Answer: C) Deterministic transitions.**

**14. What Grammar will produce Regular Languages in the Chomsky hierarchy**

A) Type 0

B) Type 1

C) Type 2

D) Type 3

**Answer: D) Type 3**

**15. Which of the following languages is not a valid language for finite automaton?**

A) {0,1}*

B) {0^n1^n | n â‰¥ 0}

C) (a+b)*

D) All regular languages

**Answer: B) {0^n1^n | n â‰¥ 0}**

**16. Which type of automata is used to simulate the regular expressions?**

A) DFA

B) PDA

C) Turing machine

D) LBA

**Answer: A) DFA**

**17. Which of the following is not a regulanguageages?**

A) Intersection

B) Complement

C) Concatenation

D) Reversal

**Answer: D) Reversal**

**18. What is the Closure Property of Context languages?**

A) Closed under intersection

B) Closed under concatenation

C) Closed under complement

D) Closed under union

**Answer: D) Closed under union**

**19. Which is that class of machine that accepts any recursively enumerable language?**

A) DFA

B) NFA

C) PDA

D) Turing machine

**Answer: D) Turing machine**

**20. Nondeterministic Finite Automaton (NFA) Most important characteristic?**

A) Input multiplicity edge

B) One to One from each input) A single transition for every input

C) Infinite tape

D) Stack-based memory

**Answer: A) Input multiplicity edge**

**21. Non-Regular Automate Non-Regular Language Which automate is unable to recognize regular language?**

A) DFA

B) PDA

C) NFA

D) All of the above

**Answer: B) PDA**

**22. Linear Bounded Automaton (LBA): What is the computational model?**

A) Turing machine unlimited tape

B) Bounded-Tape Turing Machine

C) Pushdown automaton

D) DFA with stack

**Answer: B) Bounded-Tape Turing Machine**

**23. What is the Level of Grammar That Represents Context-Free Languages?**

A) Type 0

B) Type 1

C) Type 2

D) Type 3

**Answer: C) Type 2**

**24. Memory structure of PDA**

A) Stack

B) Queue

C) Array

D) Linked list

**Answer: A) Stack**

**25. Non-deterministic machineA.**

A) DFA

B) NFA

C) DPDA

D) LBA

**Answer: B) NFA**

**26. How can a Turing machine be simulated by a formal model?**

A) PDA

B) NFA

C) DFA

D) LBA

**Answer: D) LBA**

**27. Cause like, what is this theorem pumping for?**

A) Proof of A language is regular:

B) Prove language is non-regular.

C) Proving that a language is Context-Free

D) Prove that a Language is Context Sensitive

**Answer: B) Prove language is non-regular.**

**28. Higher capability of the finite state machine is achieved by **

A) DFA

B) PDA

C) Turing machine

D) LBA

**Answer: C) Turing machine**

**29. Language of DPADAå®šçš„è¯è¨€**

A) Regular language

B) Deterministic Context-free Languages

C) Recursive language

D) Context-sensitive language

**Answer: B) Deterministic Context-free Languages**

*30. One automaton uses a queue as a memory structure from the following-*

A) DFA

B) Turing machine

C) PDA

D) LBA

**Answer: D) LBA**

**31. This is also called: for which problem is a Turing machine not enough?**

A) Halting problem

B) Regular Languages Membership Problem

C) Emptiness problem for DFA

D) Two regular languages are indistinguishable.

**Answer: A) Halting problem**

**32. Python is a context and all others are context-sensitive.**

A) {a^n b^n | n â‰¥ 0}

B) {a^n b^n c^n | n â‰¥ 0}

C) {a^n | n â‰¥ 0}

D) {a^n b^n d^n | n â‰¥ 0}

**Answer: B) {a^n b^n c^n | n â‰¥ 0}**

**33. What are among the Regular languages?**

A) Finite only every regular language is finite

B) The regular languages are closed under the intersection.

C) Regular languages may be infinite.

D) DFA is more powerful than NFA.

**Answer: B) The regular languages are closed under the intersection.**

**34. If this is a context-free language, what machine accepts it?**

A) DFA

B) PDA

C) Turing machine

D) LBA

**Answer: B) PDA**

**35. The output is produced by a finite automaton.**

A) Accept or reject

B) Numerical value

C) Stack configuration

D) Head movement

**Answer: A) Accept or reject**

**36. Which one of the below languages is nonregular?**

A) (a+b)*

B) {a^n b^n | n â‰¥ 0}

C) (a+b)+

D) ab

**Answer: B) {a^n b^n | n â‰¥ 0}**

**37. What is LBA in automata?**

A) Linear Bounded Automaton

B) Lagrangian Boundary Automaton.

C) Localized Binary Automaton

D) Large Bounded Automaton

**Answer: A) Linear Bounded Automaton**

**38. Which of the following mechanisms accepts the type-0 languages?**

A) DFA

B) PDA

C) Turing machine

D) LBA

**Answer: C) Turing machine**

**39. A language that is regular C. Improve the Answer**

A) {a^n b^n c^n | n â‰¥ 0}

B) {a^n | n â‰¥ 0}

C) {a^n b^n | n â‰¥ 0}

D) (a+b)*

**Answer: D) (a+b)***

**40. A Turing machine fits any one of these three properties;**

A) Is a Universal Representor of any other automaton

B) We accept non-finite language

C) Always halts

D) Uses stack-based memory

**Answer: A) Is a Universal Representor of any other automaton**

**41. In DFA what transition function?**

A) To accept or reject input

B) From one state to another.

C) To reset the machine

D)Input ALTERB +++ALER->alter by Kurtz + and reverse detruncator.

**Answer: B) From one state to another.**

**42. The one machine that can accept all regular languages is**

A) DFA

B) PDA

C) Turing machine

D) LBA

**Answer: A) DFA**

**43. What will be the most potent of the lot?**

A) DFA

B) PDA

C) NFA

D) Turing machine

**Answer: D) Turing machine**

**44. What is the deliverable (e.g. which language is decidable by a Turing machine)?**

A) Regular language

B) Context-sensitive language

C) Context-free language

D) All of the above

**Answer: D) All of the above**

**45. What does the âˆŠ NFA stand for?**

A) Epsilon transition

B) Empty string transition

C) Error state

D) Exceptional state

**Answer: A) Epsilon transition**

**46. The important is what the PDA is supposed to be used for.**

A) For regular languages

B) For context-free languages

C) The generation of context-sensitive languages. c)

D) Manipulating recursive languages

**Answer: B) For context-free languages**

**47. The stack for PDA assistance**

A) Memory retention

B) Handling recursion

C) Infinite computation

D) Computations â€”â€”ã€‹Turing completeness

**Answer: B) Handling recursion**

**48. Which of the following is an undecidable problem for context-free languages?**

A) Emptiness problem

B) Membership problem

C) Halting problem

D) Equivalence problem

**Answer: D) Equivalence problem**

**49. Which automat has a for each input symbol from every state a transition?**

A) DFA

B) PDA

C) NFA

D) Turing machine

**Answer: A) DFA**

**50. Which machine can be deterministic/non-deterministic Answe **r is DPDA-Qè¡¨ç¤ºç”¨èªžDeterminpushdown**h down automata.**

A) DFA

B) NFA

C) LBA

D) Turing machine

**Answer: D) Turing machine**