home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.theory.cell-automata
- Path: sparky!uunet!gatech!ukma!gang
- From: gang@ms.uky.edu (Gang Li)
- Subject: question of property of regular set
- Message-ID: <1992Sep14.125059.22229@ms.uky.edu>
- Date: Mon, 14 Sep 1992 16:50:58 GMT
- Organization: University Of Kentucky, Dept. of Math Sciences
- Lines: 12
-
- I hope this is the correct group to ask this question.
- In "Introduction to automata theory, languages, and computation." by Hopcroft
- etc, on page 56: "The lemma (pumping lemma) does not state that every
- sufficiently long string in a regular set is of the form u(v^i)w for some
- large i."
- Does this mean there is such a regular set which contains at least one
- sufficiently long string which is not of the form u(v^i)w for some large i.
- If there is one, can any expert give me an example of it?
- Thank you very much!
- e-mail prefered.
-
- gang@ms.uky.edu
-