Awesome q2a theme
0 votes
28 views
Identify from the list below the regular expression that generates all and only the strings over alphabet {0,1} that end in 1.


(0*1*)+1

(0+1)*1+1

(0*+1)+

(0*1)
in Theory of Computation by (6 points) | 28 views
0
$(0+1)^*1+1$
0

Are the options right ?

  1. (0*1*)+1 - is this $(0^*1^*)+1$ or $(0^*1^*)^+1$ ?
  2. (0+1)*1+1 - is this $(0+1)^*1+1$ or $(0+1)^*1^+1$

 

In any case, I think the answer will be the 2nd one.

0

@ But (2) is not generating ε. Right?

0

That's the whole point - it should not generate $\epsilon$ !

Question says 

 generates all and only the strings over alphabet {0,1} that end in 1

0

@shashin yes you are right sry missed it

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
Top Users 2020 Aug 03 - 09
  1. Mellophi

    98 Points

  2. Ashutosh777

    70 Points

  3. Kushagra गुप्ता

    12 Points

  4. srestha

    11 Points

  5. arjun12

    10 Points

  6. prakhar2810

    8 Points

  7. sdutta

    7 Points

  8. shivarajkumar

    6 Points

  9. kuldeep kumar07

    6 Points

  10. toppoavinash

    6 Points

Weekly Top User (excluding moderators) will get free access to GATE Overflow Test Series for GATE 2021
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Aug 2020
  1. Mellophi

    104 Points

  2. Ashutosh777

    73 Points

  3. Shaik Masthan

    13 Points

  4. srestha

    13 Points

  5. Kushagra गुप्ता

    12 Points

  6. arjun12

    10 Points

  7. Unnayan kumar

    8 Points

  8. prakhar2810

    8 Points

  9. sdutta

    7 Points

  10. Sourav Kar

    7 Points

7,725 questions
1,826 answers
11,148 comments
95,095 users