0 votes 0 votes build an fa that accepts language of all strings of length 4 or more such that next to last (second last) letter is equal to the second letter of input string Theory of Computation finite-automata + – nida nadeem asked Feb 28, 2017 nida nadeem 1.5k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Tesla! commented Apr 8, 2017 reply Follow Share Incomplete question what is input symbol please define 0 votes 0 votes hashir inayat commented Jul 17, 2017 reply Follow Share input is sigma={ a,b} 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes The language is infinite and backtracking is not possible in DFA we can't construct a Finite automata for this language. Deepthi_ts answered Apr 11, 2017 Deepthi_ts comment Share Follow See all 0 reply Please log in or register to add a comment.
