Let L = { a^n b^i a^k | k > n + i } a. List all strings of length 7. (use power notation: i.e. aabbbbaaaaaaaa is a^2b^4a^8) b. Use the Pumping Lemma for Regular Languages to prove that L is not regular.
Added by Xavier D.
Close
Step 1
- L = { a^n b^i a^k | k > n + i } - This means for any string in L, the number of 'a's after the 'b's (k) must be greater than the sum of the number of 'a's before the 'b's (n) and the number of 'b's (i). Show more…
Show all steps
Your feedback will help us improve your experience
Vaidik Stats and 89 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Consider the regular grammar given below: S -> aSlaAIbBIA A -> aAlbS B -> bBlaS Give derivations for the strings aabbba and baaba. Give an infinite language L such that L is not a subset of L(G). Give a regular expression that describes the language L(G).
Shaik D.
Show that if $A$ is a regular set, then $A^{R}$ , the set of all reversals of strings in $A,$ is also regular.
Modeling Computation
Language Recognition
Show that the set $\left\{0^{2 n} 1^{n} | n=0,1,2, \ldots\right\}$ is not regular using the pumping lemma given in Exercise $22 .$
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD