“Kleene’s theorem”的概念、定义、翻译、参考文献-科学参考

Kleene’s theorem

Computer

1. on regular expressions. A theorem in formal language theory proposed by Stephen Kleene and stating that a language is definable by a regular expression if and only if it is recognized by a finite-state automaton. A regular expression equivalent to a finite-state automaton can be found by solving a set of simultaneous linear equations (see Arden’s rule, linear grammar). Regular expressions were first used to characterize the power of certain neural networks.
2. on fixed points. See fixed-point theorem.

单词	Kleene’s theorem
释义	Kleene’s theorem Computer 1. on regular expressions. A theorem in formal language theory proposed by Stephen Kleene and stating that a language is definable by a regular expression if and only if it is recognized by a finite-state automaton. A regular expression equivalent to a finite-state automaton can be found by solving a set of simultaneous linear equations (see Arden’s rule, linear grammar). Regular expressions were first used to characterize the power of certain neural networks. 2. on fixed points. See fixed-point theorem.
随便看	acceptable quality level acceptable risk acceptable use policy acceptance acceptance region acceptance sampling acceptance testing acceptance–rejection algorithm accepting house acceptor acceptor levels Access access access control access control list accessibility accessibility relation accessible accession criteria access method access number accessory bud accessory chromosome accessory cloud accessory, lithic