What are the two types of Finite Automata (FA)?

Deterministic Finite Automata (DFA) and Nondeterministic Finite Automata (NFA)

Fill in the blank: A DFA is characterized by a transition function defined as δ: Q X ∑ → ______.

Q

True or False: Every NFA can be converted into a DFA, but not every DFA can be converted into an NFA.

False. Every DFA can be seen as an NFA, but not every NFA can be directly converted back into a DFA.

Riddle: I can move without input in one step, but I am not a ghost. What am I?

Nondeterministic Finite Automaton (NFA)

What is the formal specification of a Finite Automaton?

{ Q, ∑, q, F, δ }

In the context of regular expressions, the operation denoted by '*' signifies ______.

Kleene Closure

Which closure property of regular languages states that the union of two regular languages is also regular?

Union

Fill in the blank: The language L = {a^n b^n | n ≥ 0} is ______.

Not regular

True or False: A Moore machine's output depends solely on the current state.

True

What is the transition function for a Nondeterministic Finite Automaton (NFA) denoted as δ?

Δ: Q X (∑ U ϵ) → 2^Q