In the problem, I was given the grammar for a non-deterministic finite state automata (NDFSA). There was no other useful context given. The problem asks you to use this grammar to draw the NDFSA and then asks you to convert the NDFSA into a deterministic finite state automata (DFSA). The grammar is written as such:
G2[E]: E ::= De | Ee | Ef D ::= Ad | Ef B ::= De | c | a | Bc A ::= Ef | a
and I will attach a picture of the drawing I have of the NDFSA.
The problem I am having is that I do not understand which of these states are the final or accepting states and what qualifications a state must meet to be a final state.
I have been assuming that the final state is the one listed in the square brackets in the title of the grammar (because that was the case for the problem we did in class), but I am unsure if this is correct.
Other questions posted here mention that a final state is just a way of knowing if the input is a valid sentence for the given grammar (if and only if the last character of input leaves us in a final state), but I am more concerned with why is a final state a final state or if the problem should give (or already gives) me the final state(s).
Are final states only final states because the grammar says so, or is there something that I am missing?
[E]here may indicate that
Eis indeed the designated non-terminal/variable from which to start all derivations. $\endgroup$