1 - Deterministic finite automaton
2 - Language reconized by automaton
3 - Word recognition algorithm by automaton
Start Algorithm q←q₀ i←1 While (i≤n-1) do q←δ(q,u_{i}) i←i+1 End while If q∈F then Display "The word u is accepted" Else Display "The word u is rejected" End If End Algorithm
Younes Derfoufi
No comments:
Post a Comment