Give state diagram of dfa recognizing

Assignment Help Theory of Computation

Reference no: EM13699454

You need to prepare the finite automata and draw the machine diagram.

Part A- Give state diagram of DFA recognizing the following languages, alphabet S = {0, 1}:

1. {w | w contain the substring 01001}

2. {w | w contain at least two 1s and one 0}

Part B- Give state diagram of NFA recognizing the following languages, alphabet S = {0, 1}:

1. {w | w contain the substring 01001}

2. {w | w contain at least two 1s and one 0}

3. Construct DFA that accepts the set of strings on S = {0, 1} that consisting all the strings with precisely one 0

4. Construct DFA that accepts the set of strings on S = {0, 1} that consisting all the strings with at least one 0

5. Use induction proof, and prove that: a binary tree of height n has at most 2nleaves. Note: a binary tree is a tree in which no parent can have more than two children.

6. How cardinality of infinite sets is measured? Provide couple of closure properties of countable sets.

I cannot seem to get this to work for some reason could somebody provide me a code to compare and test? You have to satisfy the requirements specific in the instruction.

Reference no: EM13699454

Questions Cloud

How to plot each of these vector fields : You need to help on how to plot each of these vector fields - v=yi-xj and v=xi in MATLAB Programming.

Describe the applications functionality : Create an application for Koch's Cottages, a weekend getaway resort that rents cottages and boats to use on the local lake - Add labels as suitable to describe the application's functionality. Save the file as JCottageFrame.java.

Prepare a program to get a number from the user : How will you prepare a program to get a number from the user and then demonstrate the output as the result above?

Open this using a brute-force attack : What is the worst case number of combinations he must now test to try open this using a brute-force attack?

Give state diagram of dfa recognizing : Give state diagram of DFA recognizing the following languages, alphabet S = {0, 1}: - How cardinality of infinite sets is measured? Provide couple of closure properties of countable sets.

Find out the min-term of the circuit : find out the min-term of the circuit - Find the min-term expansions for X, Y, and Z (i.e. the Standard SOP expression for each). Put your final answer in short-hand notation (e.g. Sum of minterms(1, 4, 6)).

Design a new combinational logic block : You are to design a new combinational logic block called the "zeros counter". The zero counter has seven inputs X1.X2,.....X7.

Find the min-term expansions : Find the min-term expansions for X, Y, and Z (i.e. the standard SOP expression of each). Use short-hand notation in your final answer (e.g. Sum of min-terms (1, 4, 6)).

You need to do the integer comparison : Prepare a segment of code which will read in an integer and then output the subsequent:

User Account

All Pages