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

Click For Summary
SUMMARY

The discussion centers on a Theory of Computation homework problem that requires proving L = L(A) by demonstrating both L ⊆ L(A) and L(A) ⊆ L. Key concepts include mutual simple induction, the formal usage of the transition function of Deterministic Finite Automata (DFAs), and proof by contrapositive. The user seeks clarification on whether the proof of L ⊆ L(A) is dependent on the proof of L(A) ⊆ L. The linked document outlines that L consists of strings with an odd number of 1's, and the user questions the meaning of specific notations used in the problem.

PREREQUISITES
  • Understanding of Deterministic Finite Automata (DFA)
  • Familiarity with mutual simple induction
  • Knowledge of transition functions and delta notation in DFAs
  • Concept of proof by contrapositive
NEXT STEPS
  • Study the formal definitions and properties of Deterministic Finite Automata (DFA)
  • Learn about mutual simple induction techniques in formal proofs
  • Explore the delta function notation and its application in automata theory
  • Research proof techniques, particularly proof by contrapositive, in theoretical computer science
USEFUL FOR

This discussion is beneficial for students studying Theory of Computation, particularly those tackling problems related to automata theory and formal proofs. It is also useful for educators and tutors guiding students through complex proof techniques in computer science.

s3a
Messages
828
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?
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
3K
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 2 ·
Replies
2
Views
3K
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
2
Views
3K
  • · Replies 18 ·
Replies
18
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K