5/14    I just flunked my theory of computation midterm. I'm a bit baffled
        at one of the questions that I got wrong. According to the answer
        key, L is finite state, but I'm pretty sure it's not.
        L={uvu^R | u,v  in {0,1}*, |v| is even}
        So I see that u and u^R are reverse, which already tells me that
        this is like Leq (need counting), hence not finite state. Is the
	...

3/12    Iway'may eryvay eryvay impressedway atway owhay icklyquay ethay otdmay
        ormattingfay odgay ormatsfay may intentionallyway illway ormedfay
        ostspay. Iway'may onderingway ifway itway'say actuallyway away
        onedcray ormattingfay iptscray orway omethingsay, andway ifway osay,
        ancay youay easeplay ostpay ethay iptscray? anksThay
        \_ It's no script.
	...

2/29    What's the difference between a context-free-grammar and a
        context-sensitive-grammar?
        \_ Context-free: a rule maps a non-terminal onto a string of
           non-terminals and terminals; decidable by a pushdown automaton
           Context-sensitive: a rule maps a string of terminals and
           non-terminals to a _longer_ string of terminals and non-terminals;
	...

2/28    If the push-down automton can accept the language consisting of all
        words in the form (a^n b^n, n=1,2,3,...), how come no pushdown
        automaton, deterministic or non-deterministic can accept
        (a^n b^n c^n, n=1,2,3,...)? How would a linear bounded automaton
        accept this language?
        \_ Just write a perl script for some computer.  Make k large enough
	...

3/25    Are there any practical applications of Conway's Game of Life?
        \_ xlock
        \_ [ignorant babbling about the board game deleted]
        \_ A PC moria/angband/rogue/etc clone called ADOM uses it to determine
           growth for various plant life in the game.
           \_ Just saying "no" would have been shorter.
	...