Theory of Computation
Formal Languages, Regular Expressions, and Finite Automata
Describe sets of strings and build machines that recognize them.
0/1Articles read
0/3Latest correct answers
3Unanswered questions
0Due for review
Loading learning records…
Readings and practice
Formal Languages, Regular Expressions, and Finite Automata
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered