Automata Theory Final Exam

What can be regarded as a device that enumerates the sentences of a language?

• Automata

• Grammars

• Turing Machine

• Lexicon

What type of Finite State Machine ensures that each state transition is uniquely determined by the current state and input?

• Non-Deterministic Finite State Machine

• Deterministic Finite State Machine

• Mealy Machine

• Moore Machine

Equivalent automata that accepts regular language is

• Turing Machine

• Linear Bounded Automata

• Push Down Machine

• Finite Automata

What type of Finite State Machine allows multiple transitions for a given input and current state?

• Deterministic Finite State Machine

• Non-Deterministic Finite State Machine

• Mealy Machine

• Moore Machine

What is an ordered and finite list of elements in various fields of interest, including computing?

• Array

• Stack

• Tuple

• Queue

What does the Greek word “αὐτόματα” mean?

• Machine

• Handmade

• Automatic

• Self-Acting

What type of Finite State Machine has outputs that depend only on the current state?

• Deterministic Finite State Machine

• Mealy Machine

• Non-Deterministic Finite State

• Moore Machine

he basic limitation of finite automata is that

• It can't remember arbitrary large amount of information.

• It sometimes fails to recognize regular grammar.

• It sometimes grammar that are not regular.

• All of the mentioned.

Who is considered the pioneer of automata theory and the father of modern computer science?

• John von Neumann

• Ada Lovelace

• Alan Turing

• Claude Shannon

What type of Finite State Machine not only defines the states and transitions but also associates outputs with each transition?

• Deterministic Finite State Machine

• Moore Machine

• Mealy Machine

• Non-Deterministic Finte State Machine