Write a well-structured program for checking equivalence of DFSA's.
This will take the following steps:
1. Eliminate unreachable state(s)
As state#1 is the initial state, any state unreachable from state#1
must be identified and removed from further consideration (before taking
the next step of minimization)
2. Make sure that each DFSA is completely specified. That is, each state of
the DFSA has an outgoing transition on every (possible) input symbol.
3. Minimize each DFSA.
This step will check if two accepting states or two non-accepting states
are equivalent as equivalent states can be combined into just one state.
Two states are equivalent if there is no "Distinguishing" string for them.
4. Compare two minimized DFSA's for their equivalence.
Two Minimized DFSA's are equivalent if and only if
a. they have the same total number of states and
b. they have the same total number of accepting states and
c. they have the same total number of non-accepting states and
b. they have the same set of transitions after a suitable renumbering of
states (like a lexicographical ordering)
Output requirements can be found in the attached document
Hello Friend,
i am Desktop/Web based Software Developer
My good points:
- Master Degree in Computer Science
- 4+ years of experience
- Professional developer
- Delivered before time
- My good habit is to leaving comment code.
- Prefer to maintain long term friendship
----
*Before award project, share project description, Time and budget?
---
Feel free to ask any query
$25 USD in 1 day
5.0 (10 reviews)
3.7
3.7
3 freelancers are bidding on average $30 USD for this job
Hi,
I find your requirement interesting. I have good knowledge in automata theory.
I would love to work on this.
You can rely on me : )
Best regards
-Azhar