Computational language theory proof

In summary, the conversation is about proving a statement involving the reversal of languages and the concatenation of strings. The person is stuck and unsure of how to proceed with the proof, but mentions that calculating L2^RL1^R may provide some insight.
  • #1
sbc824
5
0

Homework Statement



I need to prove this

http://www.freeimagehosting.net/newuploads/66exd.jpg

R represents the reversal of...L1 and L2 represent languages, which can represent strings.

(L1L2) = the concatenation of L1 and L2

Ex.

L1 = 01001
L2 = 001

L1L2 = 01001001
(L1L2)^R = 10010010


The Attempt at a Solution



Let y be a member of E* denote an arbitrary string in the set (L1L2)^R.

This is where I'm stuck...
 
Physics news on Phys.org
  • #2
sbc824 said:

Homework Statement



I need to prove this

http://www.freeimagehosting.net/newuploads/66exd.jpg

R represents the reversal of...L1 and L2 represent languages, which can represent strings.

(L1L2) = the concatenation of L1 and L2

Ex.

L1 = 01001
L2 = 001

L1L2 = 01001001
(L1L2)^R = 10010010
And what is L2^RL1^R? That seems the obvious thing to calculate to see what the question is asking.

The Attempt at a Solution



Let y be a member of E* denote an arbitrary string in the set (L1L2)^R.

This is where I'm stuck...
 

FAQ: Computational language theory proof

What is computational language theory proof?

Computational language theory proof is a branch of computer science that focuses on the study of formal languages and their computational properties. It involves using mathematical techniques to prove theorems about the behavior and complexity of languages and language-processing algorithms.

What are some common applications of computational language theory proof?

Some common applications of computational language theory proof include natural language processing, compiler design, and the development of programming languages. It is also used in areas such as artificial intelligence, cryptography, and bioinformatics.

What are the key concepts and principles in computational language theory proof?

Some key concepts and principles in computational language theory proof include formal languages, automata theory, computability theory, and complexity theory. These concepts help to define and analyze the properties and capabilities of languages in a mathematical and systematic way.

How does computational language theory proof differ from traditional linguistics?

Computational language theory proof differs from traditional linguistics in that it focuses more on the formal and mathematical aspects of language rather than its use and structure in natural communication. It also involves the use of computers and algorithms to analyze and manipulate languages.

What are some challenges in conducting computational language theory proof?

Some challenges in conducting computational language theory proof include the complexity of language systems, the need for advanced mathematical and computational skills, and the difficulty in translating real-world language use into formal and abstract models. Additionally, as language is constantly evolving, it can be a challenge to keep up with new developments and adapt theories accordingly.

Similar threads

Proof by Induction of shortest suffix of concatenated string
Replies
1
Views
1K
Magnetic Field at any Point Around a Finite Straight Wire
Replies
3
Views
3K
Are These Computer Science Languages Regular?
Replies
1
Views
2K
Is this computability theory proof correct?
Replies
1
Views
1K
Courses Will a Machine Language Course Benefit My Computational Physics Emphasis?
Replies
5
Views
2K
Is Alan Turing given too much credit when it comes to computers?
Replies
29
Views
4K
MHB Graph Theory Proof: Connectivity of G Proven
Replies
3
Views
2K
Challenge Micromass' big August challenge
4
Replies
105
Views
13K
Does Busch's Theorem Offer a Simplified Proof of Gleason's Theorem?
2
Replies
54
Views
10K
I Micromass' big October challenge
4
Replies
125
Views
18K

Hot Threads

Recent Insights

Back
Top