CMPUT 461 Finite State Automata
Exam Questions With 100% Verified
Answers
Automaton -
correct answer ✅Abstract model
Defines a language, where language is all the strings that it accepts
Input: string
Output: yes/no (accepted or not accepted)
Chomsky Hierarchy: Regular -
correct answer ✅finite-state
regular expressions
named entity recognition, shallow parsing
Chomsky Hierarchy: Context-free -
correct answer ✅push-down automata
most natural language and programming language phenomena
FSA Formal definition -
correct answer ✅FSA is a 5-tuple consisting of:
Q: set of states {q0, q1, q2, q3, q4}
An alphabet of symbols {a, b, !}
Exam Questions With 100% Verified
Answers
Automaton -
correct answer ✅Abstract model
Defines a language, where language is all the strings that it accepts
Input: string
Output: yes/no (accepted or not accepted)
Chomsky Hierarchy: Regular -
correct answer ✅finite-state
regular expressions
named entity recognition, shallow parsing
Chomsky Hierarchy: Context-free -
correct answer ✅push-down automata
most natural language and programming language phenomena
FSA Formal definition -
correct answer ✅FSA is a 5-tuple consisting of:
Q: set of states {q0, q1, q2, q3, q4}
An alphabet of symbols {a, b, !}
