0 votes 0 votes construct the minimul FA, that accepts all the string of 0's and 1's A)The second symbol from the right end of the string is 0 B)The third symbol from the right end of the string is 1 Theory of Computation finite-automata theory-of-computation minimal-state-automata + – suraj patel asked Jul 10, 2018 suraj patel 859 views answer comment Share Follow See 1 comment See all 1 1 comment reply Satbir commented Jul 10, 2018 i edited by Satbir Feb 13, 2019 reply Follow Share https://youtu.be/57JlxQArBXk https://youtu.be/FqV92SA8a0Y This would help 0 votes 0 votes Please log in or register to add a comment.