🎴 Flashcard Mode
Test 2 - Theory of Computation | Computer Science(CS)
Card1 / 21
Mastered0
Review0
QuestionClick to flip
Consider the following Finite State Automaton:
The language accepted by this automaton is given by the regular expression
AnswerClick to flip back
A
ba (a + b)
💡 Explanation:
