I have a burning question about finite state machines, that how we can know that this language needs 2 states or 3 states? I mean is there any formula for that?
Although I believe, we would always work to minimize the number of states but still **How can we determine the number of states to be created according to any language or string (without actually constructing the DFA)?**