B = {anbmcn | m, n ≥ 0}

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Prove that the following language is not regular using the pumping lemma.

a.
B = {a¹bmcn | m, n ≥ 0}
Transcribed Image Text:a. B = {a¹bmcn | m, n ≥ 0}
Expert Solution
Step 1

To prove that the language B = {a^nb^mc^n | m, n > 0} is not regular. To do this, we use the pumping lemma for regular languages, which is a powerful tool for proving that a language is not regular.

Here are the steps of the proof in more detail:

1. Assume that B is a regular language and let p be the pumping length. The pumping length is a constant that is guaranteed to exist if B is regular.

2. Consider the string w = a^pb^pc^p. This string is in B and has length |w| = 3p ≥ p. Since w is a member of B and its length is greater than or equal to the pumping length p, we can apply the pumping lemma to w.

3. According to the pumping lemma, we can write w as  w = xyz, where |xy| ≤ p and |y| > 0.

This means that the string y contains at least one symbol from the set {a}. We can write x as a^k and y as a^l (where 1 ≤ l ≤ p). We can then write z as a^(p-k-l)b^pc^p.

steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,