1 votes 1 votes Give state diagrams of NFAs recognizing the concatenation of the languages a.) {w | the length of w is at most 5 } b.) {w | every odd position of w is 1 } The NFA has to be made by concatenating two different NFAs. how can this be done ? Theory of Computation theory-of-computation finite-automata + – anumita asked Jun 6, 2017 anumita 791 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes We can concatenate NFA similar to DFA, AnilGoudar answered Jun 12, 2017 AnilGoudar comment Share Follow See 1 comment See all 1 1 comment reply anumita commented Nov 12, 2017 reply Follow Share in your concatenated nfa 1st and 3rd positions are not having 1s. whereas it is stated in the question every odd position should have 1. 0 votes 0 votes Please log in or register to add a comment.