shinbatsu/kleene-theorem

A proof illustrating Kleene’s theorem: a language is regular if it can be represented by a finite automaton or a regular expression.

语言：Haskell · GitHub 星标：12 · Fork：1

话题：dfa-construction · kleenes-theorem · nfa-implementation · state-transition

在 GitHub 上查看原仓库