TOC QUIZ 1

What type of automaton is used to recognize patterns in strings?

• Pushdown Automata
• Finite Automata
• Turing Machine
• Lambda Calculus

Which of the following is a characteristic of Moore machines?

• Outputs depend on states
• Outputs depend on inputs
• States have no outputs
• Outputs depend on state transitions

In Mealy machines, outputs are determined by:

• States only
• States and inputs
• Inputs only
• Previous outputs

What does the conversion from Mealy to Moore involve?

• Adding more states
• Removing states
• Modifying transition function
• Changing input structure

What is an example of a Non-Deterministic Finite Automaton (NDFA)?

• Accepts a single input
• Can have multiple transitions for the same input
• Always has one path
• Cannot have epsilon transitions

Which of the following is true about Deterministic Finite Automata (DFA)?

• Can have multiple paths
• Has exactly one transition for each input
• Can have epsilon transitions
• Has no accepting states

What is the process of converting NDFA to DFA called?

• Minimization
• Determinization
• State elimination
• Closure conversion

Which theorem is used to convert regular expressions to finite automata?

• Kleene's theorem
• Arden's theorem
• Pumping lemma
• Chomsky's hierarchy

What does the union of two languages represent?

• Intersection
• Concatenation
• All strings from both languages
• Strings common to both languages

In the context of automata, what does "closure" refer to?

• Repetition of a language
• A finite language
• A specific state transition
• Language intersection