GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
42 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)   | 42 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 (4.1k points)  
all correct.


Top Users Aug 2017
  1. Bikram

    5272 Points

  2. ABKUNDAN

    4730 Points

  3. akash.dinkar12

    3514 Points

  4. manu00x

    3492 Points

  5. rahul sharma 5

    3188 Points

  6. makhdoom ghaya

    2700 Points

  7. just_bhavana

    2432 Points

  8. stblue

    2244 Points

  9. Tesla!

    2090 Points

  10. pawan kumarln

    1876 Points


25,071 questions
32,226 answers
75,103 comments
30,232 users