Question 1

Find all strings recognized by this deterministic ﬁnite-state automaton.

Accepted Answer

All bit st

Question 2

determine the output for each input string, using  
-1111

Accepted Answer

The answer of determine the output for each input string,...

Question 3

Find the language recognized by this nondeterministic ﬁnite-state automaton.

Accepted Answer

The answer of Find the language recognized by this nondeterministic...

Question 4

Let  A={0,11} . Find  A3 .

Accepted Answer

{000, 0011, 01111, 0

Question 5

Find a production of the form "A → ____" such that S → 0A, A → ____ produces {00}.

Accepted Answer

The answer of Find a production of the form "A...

Question 6

Consider the Turing machine T : $$\left( s _ { 0 } , 0 , s _ { 1 } , 1 , R \right) , \left( s _ { 0 } , 1 , s _ { 1 } , 1 , R \right) , \left( s _ { 1 } , 0 , s _ { 0 } , 1 , L \right) , \left( s _ { 1 } , 1 , s _ { 0 } , 0 , R \right) , \left( s _ { 0 } , B , s _ { 1 } , 1 , R \right)$$ For the following tape, determine the ﬁnal tape when T halts, assuming that T begins in state s0 at the leftmost nonblank symbol. $$\begin{array} { l | l | l | l | l | l | l | l | l | } 
\hline \cdots & \mathrm { B } & \mathrm { B } & 1 & 1 & 0 & \mathrm {~B} & \mathrm {~B} & \cdots \
\hline
\end{array}$$

Accepted Answer

\[\begin{array} { l | l | l |

Question 7

Find the Kleene closure of  A={00} .

Accepted Answer

None

Find all strings recognized by this deterministic ﬁnite-state automaton.

determine the output for each input string, using -1111

Find the language recognized by this nondeterministic ﬁnite-state automaton.

Let A={0,11} . Find A³ .

Find a production of the form "A → " such that S → 0A, A → produces {00}.

Find the Kleene closure of A={00} .

The Foundations: Logic and Proofs

A: the Foundations: Logic and Proofs

Basic Structures: Sets, Functions, Sequences, Sums, Matrices

A: Basic Structures: Sets, Functions, Sequences, Sums, Matrices

Algorithms

A: Algorithms

Number Theory and Cryptography

A: Number Theory and Cryptography

Induction and Recursion

A: Induction and Recursion

Counting

A: Counting

Discrete Probability

A: Discrete Probability

Advanced Counting Techniques

A: Advanced Counting Techniques

Relations

A: Relations

Graphs

A: Graphs

Trees

A: Trees

Boolean Algebra

A: Boolean Algebra

Modeling Computation

Mathematics Problem Set: Set Theory, Number Theory, Combinatorics, and Boolean Algebra

Filters

Exam 13: A: Modeling Computation

Find all strings recognized by this deterministic ﬁnite-state automaton.

determine the output for each input string, using -1111

Find the language recognized by this nondeterministic ﬁnite-state automaton.

Let A={0,11} . Find A3 .

Find a production of the form "A → ____" such that S → 0A, A → ____ produces {00}.

Find the Kleene closure of A={00} .

The Foundations: Logic and Proofs

A: the Foundations: Logic and Proofs

Basic Structures: Sets, Functions, Sequences, Sums, Matrices

A: Basic Structures: Sets, Functions, Sequences, Sums, Matrices

Algorithms

A: Algorithms

Number Theory and Cryptography

A: Number Theory and Cryptography

Induction and Recursion

A: Induction and Recursion

Counting

A: Counting

Discrete Probability

A: Discrete Probability

Advanced Counting Techniques

A: Advanced Counting Techniques

Relations

A: Relations

Graphs

A: Graphs

Trees

A: Trees

Boolean Algebra

A: Boolean Algebra

Modeling Computation

Mathematics Problem Set: Set Theory, Number Theory, Combinatorics, and Boolean Algebra

Filters

Let A={0,11} . Find A³ .

Find a production of the form "A → " such that S → 0A, A → produces {00}.