GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
39 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 Active (1.7k points)   | 39 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

0 votes

Someone please verify!

answered by Loyal (3.8k points)  
all correct.


Top Users Aug 2017
  1. ABKUNDAN

    4670 Points

  2. Bikram

    4556 Points

  3. akash.dinkar12

    3420 Points

  4. rahul sharma 5

    3118 Points

  5. manu00x

    2864 Points

  6. makhdoom ghaya

    2450 Points

  7. just_bhavana

    2136 Points

  8. Tesla!

    2042 Points

  9. stblue

    1930 Points

  10. joshi_nitish

    1686 Points


24,969 questions
32,072 answers
74,565 comments
30,147 users