dfa - minimum no of states required for A(BC)*D? -
what minimum no. of states required in dfa of language: a(bc)*d? 3 or 4? 3 mean, can write "bc" on single arrow? if possible please explain using diagram. thank in advance.
the transition function of dfa typically defined mapping dfa state , 1 input symbol dfa state, take wikipedia's formal definition example:
a deterministic finite automaton m 5-tuple, (q, Σ, δ, q0, f), consisting of
- a finite set of states (q)
- a finite set of input symbols called alphabet (Σ)
- a transition function (δ : q × Σ → q)
- a start state (q0 ∈ q)
- a set of accept states (f ⊆ q)
so usual definition of dfa, cannot have transitions on sequence of 2 elements of alphabet. common kind of automaton allows more complex transitions generalized nondeterministic finite automata.
Comments
Post a Comment