week.thirteen

on monday we touched on the last topic of the course: pushdown automata. prof heap showed us that every fsa can be translated into a cfg, ad vice versa - simply by substituting the labels of each edges in the fsa by the prefix of every terminal established in the cfg. if every right-hand side of a production has either \epsilon or a single symbol prepended by a string of terminals, we say that the cfg is right-linear cfg. if the string has length <= 1, we say the cfg is strict right linear cfg. i'm glad that we get to touch on fsa again because i get it better than cfg - and knowing that every fsa can be translated into a cdf (and the other way around) gives me a big sigh of relief because in case i don't know how to construct a cfg directly, i can certainly do it indirectly by first constructing a fsa and deriving a cfg from it. well, this is probably the last post of my slog. i hope everyone who visited my blog had (some) fun reading them. special thanks to prof danny heap for another great semester in theory - i really hope you get to teach one of my theory courses again in the future; he was good in 165, and great in 236.

and in the words of truman burbank:

good morning, and in case i don't see ya, good afternoon, good evening, and good night!