Posted by: Alexandre Borovik | July 24, 2009

Right question

An example of a right question, from Martin Hyland:

Kleene’s Theorem: Fix a finite alphabet \Sigma. The languages recognised by a finite automaton over \Sigma are exactly the regular languages.

WHY???

WHY IS IT INTUITIVELY OBVIOUS?

About these ads

Categories

Follow

Get every new post delivered to your Inbox.

Join 75 other followers

%d bloggers like this: