12,123
edits
Changes
MyWikiBiz, Author Your Legacy — Monday October 27, 2025
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 6 (view source)
Revision as of 19:44, 27 April 2012
, 19:44, 27 April 2012→6.7. Basic Notions of Formal Language Theory: markup
|}
|}
The '''kleene star''' of <math>\underline{\underline{X}},</math> written as <math>\underline{\underline{X}}^*,</math> is defined as the set of all finite sequences over <math>\underline{\underline{X}}.</math>
The "kleene star" of X, written as X*, is defined to be the set of all finite sequences over X.
X* = Ui=0 Xk = X0 U X+ = X0 U ... U Xk U ...
{| align="center" cellspacing="8" width="90%"
| <math>\underline{\underline{X}}^* ~=~ \bigcup_{j = 0}^\infty \underline{\underline{X}}^j ~=~ \underline{\underline{X}}^0 \cup \underline{\underline{X}}^+ ~=~ \underline{\underline{X}}^0 \cup \ldots \cup \underline{\underline{X}}^k \cup \ldots</math>
|}
A standard reference for the above material is:
A standard reference for the above material is:
Denning, P.J., Dennis, J.B., & Qualitz, J.E.
* Denning, P.J., Dennis, J.B., and Qualitz, J.E., ''Machines, Languages, and Computation'', Prentice-Hall, Englewood Cliffs, NJ, 1978.
===6.8. A Perspective on Computation===
===6.8. A Perspective on Computation===
