The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
128 views

Part A:
Given : (b|ab*ab*)* 

How can it be interpreted as:
1.((b+ab*)ab*)* 
2.(b+(ab*ab*))*

3.((b+a)b*ab*)*

Part B:

1.What will be its NFA ? 

2.Can we draw a direct MINIMAL DFA for such questions?

asked in Theory of Computation by (93 points) | 128 views
+1

given  (b|ab*ab*)* is equal  to expression 2 (b+(ab*ab*))*.

given expression is produce string b.but expression 1 and 2 dose not produce it.

1 Answer

+3 votes
Best answer

............

answered by Boss (14.3k points)
selected by
0
This dfa is accepting bbbbb , but is RE also accepting it? How!?
+1
RE is accepting bbbbb also you can write RE as $(b^{*} +ab^{*}a)^{*}$
0
Sir how to simply such questions?
+1
@utkarsh ,ur RE will not give abab
+1
sorry i forgot to put * there
0

 ankitgupta.1729 DFA IS RIGHT NA??

+2
it's correct i checked it with jflap


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

36,162 questions
43,620 answers
124,005 comments
42,880 users