Virtual Labs

Language acceptance by Deterministic Finite Automata (DFAs)

What is a Deterministic Finite Automaton (DFA)?

a: A machine with infinite states and finite alphabet Explanation

Explanation

b: A finite state machine with exactly one transition for each state-symbol pair Explanation

Explanation

c: A machine that can have multiple transitions from one state Explanation

Explanation

d: A machine with memory to store previous computations Explanation

Explanation

How many components are in the formal definition of a DFA?

a: 4 components Explanation

Explanation

b: 5 components Explanation

Explanation

c: 6 components Explanation

Explanation

d: 7 components Explanation

Explanation

What does the transition function δ in a DFA map from and to?

a: From Q to Σ Explanation

Explanation

b: From Σ to Q Explanation

Explanation

c: From Q × Σ to Q Explanation

Explanation

d: From Q × Σ to P(Q) Explanation

Explanation

When does a DFA accept a string?

a: When it processes all symbols in the string Explanation

Explanation

b: When it reaches any state after processing the string Explanation

Explanation

c: When it ends in an accept state after processing the entire string Explanation

Explanation

d: When it visits an accept state at any point during processing Explanation

Explanation

What is a regular language?

a: A language with a regular pattern Explanation

Explanation

b: A language recognized by some finite automaton Explanation

Explanation

c: A language with finite strings only Explanation

Explanation

d: A language that uses regular expressions Explanation

Explanation

What does it mean for a DFA to 'recognize' a language?

a: The DFA can generate all strings in the language Explanation

Explanation

b: The DFA accepts exactly the strings that are in the language Explanation

Explanation

c: The DFA can count the number of strings in the language Explanation

Explanation

d: The DFA can determine if the language is finite Explanation

Explanation

In a DFA state diagram, what do the arrows represent?

a: The order in which states were created Explanation

Explanation

b: The transitions between states based on input symbols Explanation

Explanation

c: The hierarchy of states Explanation

Explanation

d: The distance between states Explanation

Explanation

What happens if a DFA encounters an input symbol for which there is no defined transition from the current state?

a: The DFA accepts the string Explanation

Explanation

b: The DFA rejects the string Explanation

Explanation

c: The DFA waits for the next symbol Explanation

Explanation

d: The DFA returns to the start state Explanation

Explanation

Which of the following is a key property of DFAs?

a: They have unlimited memory Explanation

Explanation

b: They can solve any computational problem Explanation

Explanation

c: They are memoryless (no memory of previous states) Explanation

Explanation

d: They can modify their transition function during execution Explanation

Explanation