Click here to Skip to main content
15,893,381 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
Hi:
im implimenting a DFA having 5 states using c++
when i try to do it seems hard to me if u have a code that impliment a DFA with 5 states or (>5) please help?
"thanks for ur advice"
Posted

If you need it then you have to understand it. Start reading some introductory material as the Wikipedia page [^], but the go deeper reading a good book about.
:)
 
Share this answer
 
To clarify for Eugen Podsypalnikov and the rest of us too, I believe that you are talking about a Deterministic Finite Automaton - a type of finite state machine.

I'm guessing that this is a homework assignment.

How have you been trying to do it, and what difficulties have you encountered with your approach?
 
Share this answer
 
Please verify
that my find result for DFA[^] was wrong... :-D
 
Share this answer
 

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900