Explore BrainMass
Share

Theory of Computation

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

Let x be an element of Σ+ be a word. Show that for all such x, the language L=x* is regular. Give an example of x such that the language:

L subscript 2/3 = {uw l there exists a y an element of L, y=uvw, l u l = l v l = l wl }

is not regular. Prove your answer.

(note: l l is equal to the length)

Please see the attached file for a more concise view of the problem.

© BrainMass Inc. brainmass.com October 16, 2018, 5:52 pm ad1c9bdddf
https://brainmass.com/computer-science/programming-languages/theory-of-computation-problems-66277

Attachments

Solution Summary

Theory of Computation is embedded.

$2.19
Similar Posting

Theory of computation

Summarize the significance of the halting problem in the field of theoretical computer science.

View Full Posting Details