Such a wonderful topic...
Yes, I need to get myself acquainted with the definition of regular expression/formal languages first before re-reading the lecture notes to fully understand it.
We did the mutual exclusion of binary numbers 0 and 1 for x \in L1, X \in L(1*(01*01*)*). The amounts of *s, 0s, and 1s really make me uncomfortable, so does all other regular expression I've seen so far.
Oh well! Guess I need practice, but first I need to make sure I prepare myself well for the next term test ahead.
Subscribe to:
Post Comments (Atom)
1 comment:
I'd suggest tinkering with the 'grep' utility, or the web site mentioned in the slides. These won't help with proofs, but they'll give you more of a feel for what the subject is about.
Post a Comment