Question

draw a NFA accepting the set of all strings whose second last symbol is 1​

Answer 1

Answer:

Problem – Draw deterministic finite automata (DFA) of the language containing the set of all strings over {a, b} in which 2nd symbol from RHS is ‘a’.

The strings in which 2nd last symbol is “a” are:

Explanation:

hope I think this is helpful