The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
49 views
Ques:- How to create minimal DFA over w where w belongs to (a,b)* such 2nd symbol from RHS should be 'a'?
asked in Theory of Computation by (41 points) | 49 views

1 Answer

+1 vote

4 states is required.

answered by Boss (12.9k points)
0
Hi Abhishek,

Thanks for your solution but just I had one doubt Why in NFA diagram we are not having any transition for a,b means why it is 'phi'.

Thanks
0
Regular expression to nfa conversion is easy . And we can easylly convert  nfa to dfa .

R.E------> nfa-------> dfa
0

The minimum number of states required in a minimal dfa for a string with nth symbol from RHS will be 2​​​​​​n.  

So in this case second symbol from RHS will give 4 states

 

0
Thanks For your time :)


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

35,518 questions
42,792 answers
121,605 comments
42,162 users