Theory of Computation
Wednesday, November 28, 2012
DFSA example
:Devise a DFSA that accepts the language of strings over {0,1} with an odd number of 1s and even number of 0s.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment