But I prefer to learn Theory of computation by analysis instead of using the Mathematical derivation approach. The transition graph must first be converted into a standard form without the null-move and single start state. I have explained here how to write a regular expression for a DFA using Arden's theorem. Finite Automata, Automata Theory, Deterministic Finite Automata, Transition Table, Automaton 1. You can improve it by first convert given DFA into minimized DFA then write RE and description.Īlso, there is a Derivative Method to find RE from a given Transition Graph using Arden's Theorem. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |