CMPUT 461 Exam Questions With
100% Verified Answers
Regular Language -
correct answer ✅Is a language that can be represented or
designed using a FSM
Non-Regular Language -
correct answer ✅A language that CANNOT be represented or
designed using a FSM.
Language -
correct answer ✅a collection of strings that a given automaton can
recognize or generate. A finite state automaton accepts or rejects
strings based on its state transitions, and the set of strings it
accepts forms the language recognized by the automaton.
NFA - Nondeterministic Finite Automata -
correct answer ✅Given the current state, there could be multiple
next states. The next state may be chosen at random, or at parallel.
Valid operations would include Union, Concatenation, Kleene Star,
Epsilion Transitions.
, CMPUT 461 Exam Questions With
100% Verified Answers
DFA - Deterministic Finite Automata -
correct answer ✅Given the current state, we know what the next
state will be. It only has a single unique next state, this means no
choices or randomness.
DFA Are good for tracking multiple requirements at a time, so they
can do things like intersections, and complements.
T/F - Every DFA can be turned into an NFA, and vice versa. -
correct answer ✅True
T/F - We can always find a FSA (deterministic or not) to accept the
strings of a regular language. -
correct answer ✅True
Phonetics + Phonology -
correct answer ✅knowledge about linguistic sounds
Morphology -
correct answer ✅knowledge of the meaningful components of
words
100% Verified Answers
Regular Language -
correct answer ✅Is a language that can be represented or
designed using a FSM
Non-Regular Language -
correct answer ✅A language that CANNOT be represented or
designed using a FSM.
Language -
correct answer ✅a collection of strings that a given automaton can
recognize or generate. A finite state automaton accepts or rejects
strings based on its state transitions, and the set of strings it
accepts forms the language recognized by the automaton.
NFA - Nondeterministic Finite Automata -
correct answer ✅Given the current state, there could be multiple
next states. The next state may be chosen at random, or at parallel.
Valid operations would include Union, Concatenation, Kleene Star,
Epsilion Transitions.
, CMPUT 461 Exam Questions With
100% Verified Answers
DFA - Deterministic Finite Automata -
correct answer ✅Given the current state, we know what the next
state will be. It only has a single unique next state, this means no
choices or randomness.
DFA Are good for tracking multiple requirements at a time, so they
can do things like intersections, and complements.
T/F - Every DFA can be turned into an NFA, and vice versa. -
correct answer ✅True
T/F - We can always find a FSA (deterministic or not) to accept the
strings of a regular language. -
correct answer ✅True
Phonetics + Phonology -
correct answer ✅knowledge about linguistic sounds
Morphology -
correct answer ✅knowledge of the meaningful components of
words
