Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
lfa:prop [2018/10/23 11:02] pdmatei [Intersection] |
lfa:prop [2019/10/31 13:56] (current) pdmatei |
||
|---|---|---|---|
| Line 11: | Line 11: | ||
| Consider the following NFA built (with respect to $math[M_a]) to accept words of the above language: | Consider the following NFA built (with respect to $math[M_a]) to accept words of the above language: | ||
| - | {{:lfa:arithmetic_fin.jpg?600|}} | + | {{:lfa:parenexpr.jpg?600|}} |
| One can easily observe that the above automaton can only accept words of the following forms: | One can easily observe that the above automaton can only accept words of the following forms: | ||
| Line 38: | Line 38: | ||
| $theorem[Pumping Lemma] | $theorem[Pumping Lemma] | ||
| - | Let $math[L] be a regular language. Then there exists $math[n] (dependent on $math[L]) such that for every word $math[w\in L] satisfying $math[|w|\leq n] has the following form: | + | Let $math[L] be a regular language. Then there exists $math[n] (dependent on $math[L]) such that for every word $math[w\in L] of length larger than $math[n] has the following form: |
| * $math[w = xyz] where | * $math[w = xyz] where | ||
| * $math[\mid xy \mid \leq n] | * $math[\mid xy \mid \leq n] | ||