GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
83 views
Design a NFA and DFA for the following ::

1) Accepting all substrings of the string abab.

2) Accepting all prefixes of the string abab.

3) Accepting all suffixes of the string abab.
asked in Theory of Computation by Loyal (3.1k points) 3 6 50 | 83 views
Given string = abab

Sub-strings  { e, a,b,ab,ba,aba,bab, abab }

prefixes { e,a,ab,aba,abab}

suffixes { e, b,ab,bab,abab}

here e stands for epsilon(empty string).

all the three sets are finite so you can easily design both nfa and dfa now.

1 Answer

+1 vote

Someone please verify!

answered by Boss (7.6k points) 3 17 58
all correct.


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
Top Users Oct 2017
  1. Arjun

    23706 Points

  2. Bikram

    17298 Points

  3. Habibkhan

    9336 Points

  4. srestha

    6566 Points

  5. Debashish Deka

    5478 Points

  6. jothee

    5188 Points

  7. Sachin Mittal 1

    4910 Points

  8. joshi_nitish

    4514 Points

  9. manu00x

    4158 Points

  10. sushmita

    4098 Points


Recent Badges

Verified Human Terminator
Verified Human maheshtheng
Nice Answer Ahwan
Renewal Ahwan
Notable Question pranab ray
Notable Question Tuhin Dutta
Great Question jothee
Ancestor santhoshdevulapally
Nice Question Pradip Nichite
Famous Question smartmeet
27,447 questions
35,307 answers
84,718 comments
33,549 users