The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+18 votes
504 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.5k points)
edited by | 504 views

1 Answer

+21 votes
Best answer

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

answered by Veteran (55k 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

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

38,039 questions
45,533 answers
131,816 comments
48,849 users