| | |
Simple DFA question
Please support our Computer Science advertiser: Learn about neural networks and artificial intelligence.
![]() |
•
•
Join Date: May 2004
Posts: 92
Reputation:
Solved Threads: 9
0
#2 Nov 2nd, 2009
Since you can't track a count of zeros and ones in a DFA, try looking at having a state for each possible outcome as you run through the input string--so your states would represent combinations of even/odd zeros and even/odd ones.
--smg
![]() |
Similar Threads
- Simple Winsock Question? (C++)
- Simple Array Question (Java)
- a simple question about inheritence (C++)
- Simple Pointer Question (C++)
- Simple newbie C question (C)
- ultra simple function question (C++)
- Simple Map Question (C++)
- Simple array question (C++)
- Simple (I think) Code Question (PHP)
Other Threads in the Computer Science Forum
- Previous Thread: Fabricated Software/Programs
- Next Thread: Round Robin Completion Time
| Thread Tools | Search this Thread |






