shinbatsu / kleene-theoremView on GitHub
A proof illustrating Kleene’s theorem: a language is regular if it can be represented by a finite automaton or a regular expression.
☆12May 8, 2025Updated last year

Alternatives and similar repositories for kleene-theorem

Users that are interested in kleene-theorem are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.

Sorting:

Are these results useful?