Quick Thoughts on Test 2 and FSA

Got back test 2 and the recent problem set. I was generally happy with the marks which was good. As the semester is coming to an end it seems like all the work is starting to pile up.

This week we've continued to look at regular expressions and finite stat automata. The idea is that we can use regular expressions as a way to express a language. We can design our own language to with different alphabets. We looked at some examples looking at binary numbers containing even or odd number of zeros. The language can further be manipulated by applying principles such as commutativity or distributivity to the regular expression to create another regular expression.

We looked at some DFSAs where we created a machine which would take in a string and would be able to tell us whether it was a valid string by traverserving between the states. We say an example where we created a machine that accepted a binary string and would enter an accepting state for an even number of 0's. It seems the hard part is how to construct a machine for a particular collection of strings; all won't be as obvious as the binary number example we looked at. We need to make sure it can correctly judge all strings of that language and properly determine which are valid and which aren't. It seems to that we need to derive some state invariants and transition functions to create a correct machine.

Also a quick thought; I've went to the TA general help hours a couple of times and I've found them pretty helpful. I think going to them helped my understanding a lot for assignment 2 as well as test 2. I would suggest going to any students needing a bit of help!