in Theory of Computation
340 views
0 votes
0 votes
Set of possible strings generated by Regular expression (11+111)* should contain {null, {11}, {111}, {11111},…}. Can this set contain the strings which are generated considering the part of the above RE partially, i.e., will {1111} (length 4), generated by considering either {11} partially or {111} partially. Can such string be a part of the language ?
in Theory of Computation
by
5 points
340 views

3 Comments

Yes $1111$ should be in the language due to by making $*$ as $2$ and choosing $11$ both times.
0
0

@ thanks for answering, as per my understanding from your answer, we are accepting the string(s) by making combinations(multiples of minimum length) of them, i.e., (11)* can have {null, 11, 1111, 111111,...}. but still my doubt is can we have {1} also as a part of above Language set, as it is generated by taking (11)* as partially?

0
0

but still my doubt is can we have {1} also as a part of above Language set, as it is generated by taking (11)* as partially?

No you can not !

for simplicity, you can think like (11+111)* = (A+B)* , where A=11, B=111

then you can generate epsilon, A,B,AA,AB,BA,BB,......

for getting 1111 ---- you have AA, but for 1 -- you don't have anything 

0
0

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.