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

We require a four state automaton to recognize the regular expression $(a\mid b)^*abb$

  1. Give an NFA for this purpose
  2. Give a DFA for this purpose
asked in Theory of Computation by Veteran (59.9k points)
edited by | 702 views

1 Answer

+24 votes
Best answer

NFA for regular expression $(a+b)^*abb$ and its equivalent DFA will be as follows:

answered by Veteran (55.8k points)
edited by
0

@Praveen Saini Sir What is the meaning of (a/b)* the question,is it (a+b)* what they have meant?

+1
yes, afai think
0
praveen sir u r the best toc expert ever i seen
0

 

state   a          b


qo     q0q1    q0

q1        ^         q2

q2       ^           q3

q3       ^           ^

q0q1     q0q1     q0q2

q0q2      q0q1     q0q3

q0q3       q0q1     q0

 

q3 is final state so q0q3 also final state. Total 6 states.
 

Where am I going wrong? Pls help @Praveen Saini

+1

@ , there is no need of q1, q2 and q3 check once.

0

@Praveen Saini sir construct an NFA for regular expression (a+b)* abb  and then convert it into DFA, will that be okk sir ??

0
Yes, this is good, but it is a time-consuming process, we can make DFA from the regular expression.

Related questions

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
47,925 questions
52,325 answers
182,364 comments
67,790 users