finite automata - Are there any steps or rules to draw a DFA? -
in first lecture of "theory of automata", after giving concepts of alphabet, language, transition function etc. , couple of simple automata of electric circuit 1 , 2 switches, question.
i understand alphabet language of dfa is, there rules or steps followed reach correct automaton given language? or have imagine , think in our mind , solution satisfies given language?
note:- please keep language simple can, since first lecture , not yet aware of concepts regular expressions or other thing in subject matter.
if given description of language in words, say, think possible strings can apply language. then, try come dfa handles of strings. boundary conditions , generate strings. try accommodate in dfa. might starting point
Comments
Post a Comment