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
Ace Test Series: Theory Of Computation - NFA To Regular Expression
Shantanu Ghosh
asked
in
Theory of Computation
Jan 23, 2018
edited
Mar 3, 2019
by
I_am_winner
430
views
2
votes
2
votes
ace-test-series
theory-of-computation
regular-expression
Shantanu Ghosh
asked
in
Theory of Computation
Jan 23, 2018
edited
Mar 3, 2019
by
I_am_winner
by
Shantanu Ghosh
430
views
answer
comment
Follow
share this
share
4 Comments
Show 2 previous comments
by
Shantanu Ghosh
commented
Jan 23, 2018
reply
Follow
share this
I also think so... dont know how Ace guys have C as answer....
0
0
by
srivivek95
commented
Jan 23, 2018
reply
Follow
share this
(C) can't be the answer.
String "abb" is accepted by the NFA but it can't be generated by the regular expression
0
0
by
joshi_nitish
commented
Jan 23, 2018
reply
Follow
share this
it is simply accepting strings ending with 'b'
RE is
(a+b)*b
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
Kuldeep Pal
asked
in
Theory of Computation
Jan 6, 2018
179
views
Ace Test series: Theory Of Computation - Regular Expressions
Kuldeep Pal
asked
in
Theory of Computation
Jan 6, 2018
by
Kuldeep Pal
179
views
ace-test-series
theory-of-computation
regular-expression
1
vote
1
vote
0
answers
2
hacker16
asked
in
Theory of Computation
Dec 23, 2017
538
views
Ace Test Series 2018: Theory Of Computation - Regular Expressions
Consider a language L1 and L2 L1 = 1* 0 1* 0 L2 = 0* 1 0* 1 Then the quotient of L1 and L2 is ε Φ 0* 1*
hacker16
asked
in
Theory of Computation
Dec 23, 2017
by
hacker16
538
views
ace-test-series
theory-of-computation
regular-expression
2
votes
2
votes
2
answers
3
raviyogi
asked
in
Theory of Computation
Nov 2, 2017
280
views
Ace Test Series: Theory Of Computation - Regular Expressions
how to find homomorphism?
raviyogi
asked
in
Theory of Computation
Nov 2, 2017
by
raviyogi
280
views
theory-of-computation
ace-test-series
regular-expression
0
votes
0
votes
2
answers
4
Jyoti Kumari97
asked
in
Theory of Computation
Feb 16, 2019
837
views
MadeEasy WorkBook: Theory of Computation - Regular Expression
Given answer is option c. Can anyone tell me how?
Jyoti Kumari97
asked
in
Theory of Computation
Feb 16, 2019
by
Jyoti Kumari97
837
views
regular-expression
theory-of-computation
made-easy-booklet
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
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
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
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
@Aakash_Bhardwaj all the best bro . For your...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy