Question
(a) Use the Pumping Lemma to show that the language L1 = {w | {a, b, c}* |w = a^{3n}b^n, n in N} is not
(a) Use the Pumping Lemma to show that the language L1 = {w | {a, b, c}* |w = a^{3n}b^n, n in N} is not regular
(b) Use the closure properties of regular languages to prove that the language L2 = {w | {a, b, c}* |w = a^n b^m c^{m-n}, n, m in N and n <= m} is not regular. can someone solve b)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Database Systems Introduction To Databases And Data Warehouses
Authors: Nenad Jukic, Susan Vrbsky, Svetlozar Nestorov
1st Edition
1943153191, 978-1943153190
