3.2 Kleene's Theorem Flashcards
1
Q
What is Kleene’s theorem
A
2
Q
What is the language generated by a regular expression
A
3
Q
How to convert from regex to finite automata
A
‘Unpack’ the regex expression into nodes and arrows, based on each possible input. The final state should be nullable match the empty string (b*) does. Note the ‘junk’ state.
4
Q
What are Brzozowski derivatives
A
Helps translate regex to finite automata, expresses the mapping of states with actions (expressed to pow neg 1)
5
Q
How to convert from finite automata to regex GFNA method steps
A
Keep merging nodes until finished
6
Q
How to convert from finite automata to regex GFNA visually
A
