MADE EASY

Question

A minimum state deterministic finite automaton accepting the language L={w∣w∈{0,1}} where fifth symbol from the right is 0 has how many states?

Comments

its very time consuming to draw the minimal DFA for the 5th symbol From RHS

Directly can be answered i.e. =2⁵   =32 states

generalise = 2ⁱ states for i^th symbol from right-hand side 

---

any support with this statement???

---

https://gateoverflow.in/63063/dfa

https://gateoverflow.in/11769/minimal-dfa

Answer 1

In this way you can solve any such question like nth symbol from rhs is 0/1

Comments

question is for DFA