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
icon
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.
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
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Complexity
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.
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
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…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,