Commons:Deletion requests/File:TIZPOO1.5.JPG
Jump to navigation
Jump to search
This deletion discussion is now closed. Please do not make any edits to this archive. You can read the deletion policy or ask a question at the Village pump. If the circumstances surrounding this file have changed in a notable manner, you may re-nominate this file or ask for it to be undeleted.
Replaced in fa:b:حل_تمرین_نظریه_محاسبات-ویرایش_دوم/فصل_اول/حل_تمرین۱-۲۵ with text equivalent:
- Definition 1.5
A finite automaton is a 5-tuple (Q, Σ, ẟ, q0, F), where
- Q is a finite set called the states,
- Σ is a finite set called the alphabet,
- ẟ: Q × Σ ⟶ Q is the transition function,
- q0 is the start state, and
- F ⊆ Q is the set of accept states.
Now unused image that should not be an image WIKImaniac 18:50, 16 February 2021 (UTC)
- Support --Doostdar (talk) 10:59, 19 February 2021 (UTC)
Deleted: out of project scope. --George Chernilevsky talk 05:56, 23 February 2021 (UTC)