Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
regular languages
|
| gptkbp:category |
theorems in the theory of computation
|
| gptkbp:field |
automata theory
formal language theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Kleene's theorem
|
| gptkbp:implies |
every regular language can be accepted by a finite automaton
every language accepted by a finite automaton can be described by a regular expression |
| gptkbp:namedAfter |
gptkb:Stephen_Cole_Kleene
|
| gptkbp:publishedIn |
gptkb:Representation_of_Events_in_Nerve_Nets_and_Finite_Automata
|
| gptkbp:relatedTo |
gptkb:finite_automata
regular languages regular expressions |
| gptkbp:state |
the class of regular expressions and the class of finite automata define the same languages
|
| gptkbp:yearProposed |
1956
|
| gptkbp:bfsParent |
gptkb:Bruce_Kleene
|
| gptkbp:bfsLayer |
8
|