Computer Science Homework Solutions
Problem
#80889

Finite-state automata

Hi,

I'm looking for a FSA (Finite State Acceptor) for all binary strings containing an odd number of 0's.  A state diagram is the easiest for me to understand.  A valid regular expression to describe the language (I've verified this) is 1*0(1+01*0)*

Thanks!

Solution
What is this?
By OTA - Overall OTA Rating
Xiao Liu, MS - 4.7/5
Purchase Cost Now
$2.19 CAD (was ~$11.97)
Included in Download
  • Plain text response
  • Attached file(s):
    • FSA.doc
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Theory of Computation/Computer Science Problem - Consider the following three languages, all subsets of Σ* where Σ={a,b}: (1) L1 = {w l w is a word with odd number of a's} (2) L2 = {w l w is a word that ends with a b} (this que ...
  • Rules of precedence for C/C++ operators using example - Using the rules of precedence, evaluate the following expression: u*z+x/t-y+w%v
  • Software engineering - Quality Assurance Aspect - Hi, I need assistance in writing on the following problem please. Using a commercial software package as an example, discuss which properties could be verified and which properties could be valida ...
  • Two Dimensional Finite Automaton - 1. Define two dimensional finite automaton (2DIM-DFA) is defined as follows. The input is an m X n rectangle, for any m, n  2. The squares along the boundary of the rectangle contain the sym ...
  • Automata and Computability - Recall that NPSAT is the class of languages that are recognized by nondeterministic polynomial time Turing machines with an oracle for the satisfiability problem. Show that NPSAT = 2P. See ...
Browse