5b. I deserve 0 marks here. But looking back at my notes, I think this question was implicitly asking to convert the CFG to CNF. So why phrase it that way?
5c. Nice parse tree.
5b. I deserve 0 marks here. But looking back at my notes, I think this question was implicitly asking to convert the CFG to CNF. So why phrase it that way?
5c. Nice parse tree.
4b. I mean, I did construct a PDA here, it just assumes all the a's come before the b's.
4b. I mean, I did construct a PDA here, it just assumes all the a's come before the b's.
3b. I don't even know what I was going for here. I must've vaguely remembered the Myhill–Nerode theorem and just ran with that.
3c. Okay, I made one small mistake here and lost all but one mark. I'm mad about this one.
3b. I don't even know what I was going for here. I must've vaguely remembered the Myhill–Nerode theorem and just ran with that.
3c. Okay, I made one small mistake here and lost all but one mark. I'm mad about this one.
2b. This seems right about where I started to struggle, seeing how I'm attempting to convert a PDA to an NFA in step 3.
2b. This seems right about where I started to struggle, seeing how I'm attempting to convert a PDA to an NFA in step 3.
1b. Okay, this is a fairly decent conversion. Nice work, me!
1c. I'll be honest, I don't teach minimization to my students, so I forget the process. But the final DFA looks right.
1b. Okay, this is a fairly decent conversion. Nice work, me!
1c. I'll be honest, I don't teach minimization to my students, so I forget the process. But the final DFA looks right.
Spoiler alert: you'll wonder how I managed to become a theoretical computer scientist.
Spoiler alert: you'll wonder how I managed to become a theoretical computer scientist.
(Did I learn some lesson from this to stop buying more books? Ha, no.)
(Did I learn some lesson from this to stop buying more books? Ha, no.)
I think this is what those in the 1100s would've called a "flex".
I think this is what those in the 1100s would've called a "flex".