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

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.6k points)
edited by | 542 views

1 Answer

+22 votes
Best answer

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

answered by Veteran (55.3k points)
edited by

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

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

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

40,774 questions
47,479 answers
62,242 users