JA homomorphism on an alphabet is a function that gives a string for each symbol in that alphabet - for cample, a homomorphism h on the binary alphabet might be defined so that h(0) = ba and h(1) = edc. Homomorphisms can be extended to strings and languages in the straightforward way: • Ifs = s,5;5.S, then h(s) = h(s.) h(s:) h(s;... h(s»). • IfL is a language then h(L) = { h(s) | s is in L }. Show that the class of context free languages is closed under homomorphism – that is, that for any conte free language L, and any homomorphism h on its alphabet, h(L) defined as above is context free. HINT: If your proof is very long, you are doing more than you need to.
JA homomorphism on an alphabet is a function that gives a string for each symbol in that alphabet - for cample, a homomorphism h on the binary alphabet might be defined so that h(0) = ba and h(1) = edc. Homomorphisms can be extended to strings and languages in the straightforward way: • Ifs = s,5;5.S, then h(s) = h(s.) h(s:) h(s;... h(s»). • IfL is a language then h(L) = { h(s) | s is in L }. Show that the class of context free languages is closed under homomorphism – that is, that for any conte free language L, and any homomorphism h on its alphabet, h(L) defined as above is context free. HINT: If your proof is very long, you are doing more than you need to.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
100%
![A homomorphism on an alphabet is a function that gives a string for each symbol in that alphabet – for
example, a homomorphism h on the binary alphabet might be defined so that h(0) = ba and h(1) = edc.
Homomorphisms can be extended to strings and languages in the straightforward way:
If s = 5,5,53.S, then h(s) = h(s;) h(s:) h(s;)... h(s,).
• If L is a language then h(L) = { h(s) | s is in L }.
Show that the class of context free languages is closed under homomorphism – that is, that for any context
free language L, and any homomorphism h on its alphabet, h(L) defined as above is context free.
HINT: If your proof is very long, you are doing more than you need to.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F5c265bb5-8d34-4cda-8541-c90f0e8c3b8f%2Fab0b02b9-d500-4944-b7fe-0be7908691ad%2F3l7aqyj_processed.png&w=3840&q=75)
Transcribed Image Text:A homomorphism on an alphabet is a function that gives a string for each symbol in that alphabet – for
example, a homomorphism h on the binary alphabet might be defined so that h(0) = ba and h(1) = edc.
Homomorphisms can be extended to strings and languages in the straightforward way:
If s = 5,5,53.S, then h(s) = h(s;) h(s:) h(s;)... h(s,).
• If L is a language then h(L) = { h(s) | s is in L }.
Show that the class of context free languages is closed under homomorphism – that is, that for any context
free language L, and any homomorphism h on its alphabet, h(L) defined as above is context free.
HINT: If your proof is very long, you are doing more than you need to.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)