An example of a right question, from Martin Hyland:

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

WHY???

WHY IS IT INTUITIVELY OBVIOUS?

Atomic objects, structures and concepts of mathematics

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 . The languages recognised by a finite automaton over are exactly the regular languages.

WHY???

WHY IS IT INTUITIVELY OBVIOUS?

Posted in Uncategorized

%d bloggers like this:

## Leave a Reply