![]() I am a little stuck with this assignment, and would like some ideas, some pseudocode or ideas to do it. Is there any way to do it without knowing in advance the automaton alphabet? Do I need a data structure to represent automata?. Should I simply use arrays? What logic would I apply to the arrays?. I don't know how would be most convenient to represent the automaton. :Q × Q is a function, called the transition function (is the above mentioned rule, where given a state and a symbol it returns the next state) q0 is the initial state (start. So far, I've only coded the work with the input. A DFA, or deterministic finite automaton, is a 5-tuple, where: Q is the finite set of states.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |