- Posts:
- 15 (0.002 denne)
- Age:
- N/A
- Date Registered:
- 08.11.2006, 16:25:31
- Lokálny čas:
- 29.04.2024, 22:28:37
- Naposledy aktívni:
- 22.02.2010, 02:54:52
Signature:
The Pumping LemaLet L be any regular language that has infinitely many words. Then there exist three strings x, y, and z such that y is non-null and all strings of the form
xynz for n=1,2,3,...
are words in L.