Theory of Computation problem: Proving that L = L(A)

s3a
Messages
814
Reaction score
8
Hello to everyone that's reading this. :)

1. Homework Statement

(Theory of Computation) proof problem about proving that L = L(A) by proving that L ⊆ L(A) and that L(A) ⊆ L:
https://www.docdroid.net/du7lLvh/theproblemanditssolution.pdf

Homework Equations


• Mutual simple induction
• Formal usage of transition function of DFAs (meaning knowing how to use the delta notation)
• Potentially, proof by contrapositive
• Knowing that A = B can be proven by proving A ⊆ B and B ⊆ A.

The Attempt at a Solution


My question is: does the "δ̂(p, w) = p ⇒ w has even number of 1's" from second part (L ⊆ L(A)) need the first part (L(A) ⊆ L) to already be shown, or is it completely independent, such that the second part (L ⊆ L(A)) could have been cut and pasted, verbatim, before the first part (L(A) ⊆ L)?

Any input would be GREATLY appreciated!
 
Physics news on Phys.org
s3a said:
Hello to everyone that's reading this. :)

1. Homework Statement

(Theory of Computation) proof problem about proving that L = L(A) by proving that L ⊆ L(A) and that L(A) ⊆ L:
https://www.docdroid.net/du7lLvh/theproblemanditssolution.pdf

Homework Equations


• Mutual simple induction
• Formal usage of transition function of DFAs (meaning knowing how to use the delta notation)
• Potentially, proof by contrapositive
• Knowing that A = B can be proven by proving A ⊆ B and B ⊆ A.

The Attempt at a Solution


My question is: does the "δ̂(p, w) = p ⇒ w has even number of 1's" from second part (L ⊆ L(A)) need the first part (L(A) ⊆ L) to already be shown, or is it completely independent, such that the second part (L ⊆ L(A)) could have been cut and pasted, verbatim, before the first part (L(A) ⊆ L)?

Any input would be GREATLY appreciated!
Possibly the reason no one has replied is that there is not enough information here.
In the linked document it says
Let ##L = \{w \in \{0, 1\}* : \text{w has an odd number of 1's} \}##, and let A be the DFA with tabular representation ...
  1. Does the notation {0, 1}* mean an arbitrary sequence of 0's and 1's?
  2. What is a DFA? Presumably this acronym is unpacked in your textbook, but we don't have access to that information.
  3. What does the notation ##\hat \delta (p, w)## mean?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top