Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
MadeEasy Subject Test 2019: Theory Of Computation - Regular Expressions
suneetha
asked
in
Theory of Computation
Dec 22, 2018
edited
Mar 3, 2019
by
akash.dinkar12
442
views
0
votes
0
votes
the length of the shortest string which is not present in the regular expression 1*(0+10)*1* is?
made-easy-test-series
theory-of-computation
regular-expression
suneetha
asked
in
Theory of Computation
Dec 22, 2018
edited
Mar 3, 2019
by
akash.dinkar12
by
suneetha
442
views
answer
comment
Follow
share this
share
2 Comments
by
Shobhit Joshi
commented
Dec 22, 2018
reply
Follow
share this
0110 ?
0
0
by
Mk Utkarsh
commented
Dec 22, 2018
reply
Follow
share this
$0110$
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
answer will be 4, example: 0110 is minimum length string not present in above regular expression.
1997_satya
answered
Dec 22, 2018
by
1997_satya
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
3
answers
1
aaru14
asked
in
Theory of Computation
Nov 17, 2017
257
views
MadeEasy Subject Test: Theory of Computation - Regular Expressions
r1= (0+1)* r2= (00+01+10+11)* are they both equal or not??
aaru14
asked
in
Theory of Computation
Nov 17, 2017
by
aaru14
257
views
made-easy-test-series
theory-of-computation
regular-expression
1
vote
1
vote
2
answers
2
soumayan bandhu
asked
in
Theory of Computation
Nov 9, 2017
278
views
MadeEasy Subject Test: Theory of Computation - Regular Expressions
soumayan bandhu
asked
in
Theory of Computation
Nov 9, 2017
by
soumayan bandhu
278
views
made-easy-test-series
theory-of-computation
regular-expression
0
votes
0
votes
1
answer
3
rajoramanoj
asked
in
Theory of Computation
Sep 28, 2017
230
views
MadeEasy Subject Test: Theory of Computation - Regular Expressions
sometimes questions like this will take more time plz anyone provide shortcut to this type ,this is easy but many time checking from 0 length to onward is very time consuming. length of the shortest string not in the language over the alphabet${a,b}$ of following regular expression is............ $a^{*}(a+ba)^{*}b^{*}$
rajoramanoj
asked
in
Theory of Computation
Sep 28, 2017
by
rajoramanoj
230
views
made-easy-test-series
theory-of-computation
regular-expression
0
votes
0
votes
1
answer
4
Adiaspirant
asked
in
Theory of Computation
Jan 11, 2017
396
views
MadeEasy Subject Test: Theory of Computation - Regular Expressions
Tell me any string that is not accepted by option b.
Adiaspirant
asked
in
Theory of Computation
Jan 11, 2017
by
Adiaspirant
396
views
made-easy-test-series
theory-of-computation
regular-expression
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recent Posts
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
What's the answer for keystroke question
Same,easy to moderate
I felt paper was very much like AIMT 3!!
very easy paper, I don't want to discuss paper...
the paper was easy to moderate, in this paper...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
