Chapter 1: Q47P (page 90)
Question: Let and let
Prove that Y is not regular.
Short Answer
Answer:The given language is not regular language is proved by pumping lemma
Chapter 1: Q47P (page 90)
Question: Let and let
Prove that Y is not regular.
Answer:The given language is not regular language is proved by pumping lemma
All the tools & learning materials you need for study success - in one app.
Get started for freeLet . Let . Show that is a CFL.
Question: Give the formal description of the machines M1 and M2 pictured in
Let .Show that if is regular and is any language, then is regular.
Give regular expressions generating the languages of Exercise 1.6.
a. {begins with a 1 and ends with a 0}
b. { contains at least three 1s}
c. { contains the substring 0101 (i.e., w = x0101y for some x and y)}
d. { has length at least 3 and its third symbol is a 0}
e. { starts with 0 and has odd length, or starts with 1 and has even length}
f. { doesn’t contain the substring 110}
g. { the length of is at most 5}
h. { is any string except 11 and 111}
i. { every odd position of w is a 1 }
j. { contains at least two 0s and at most one 1}
k.
l. { contains an even number of 0 s, or contains exactly two 1s}
m. The empty set
n. All strings except the empty string
Question: Let and let
Thus because 101 contains a single 01 and a single 10, but because 1010 contains two 10 s and one .01 Show that D is a regular language.
What do you think about this solution?
We value your feedback to improve our textbook solutions.