2 votes 2 votes 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. Theory of Computation theory-of-computation finite-automata + – VS asked Aug 12, 2017 VS 984 views answer comment Share Follow See 1 comment See all 1 1 comment reply Gaurav Joshi commented Aug 12, 2017 reply Follow Share 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. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Someone please verify just_bhavana answered Aug 12, 2017 edited Nov 6, 2017 by just_bhavana just_bhavana comment Share Follow See 1 comment See all 1 1 comment reply joshi_nitish commented Aug 12, 2017 reply Follow Share all correct. 0 votes 0 votes Please log in or register to add a comment.