Let L be be a language over the alphabet {a, b, c} recognised by NFA. Consider the language L 0 such that every string w 0 ∈ L 0 is obtained from a string w ∈ L by replacing all occurrences of c in w by a. Prove that L 0 is NFA recognizable.
Added by Matthew E.
Step 1
Let L ⊆ {a,b,c}* be a language recognized by some NFA. Define L0 = { w0 ∈ {a,b}* | there exists w ∈ L such that w0 is obtained from w by replacing every occurrence of c by a }. Show more…
Show all steps
Your feedback will help us improve your experience
Reynald Oliveria and 74 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Let $M=\left(S, I, f, s_{0}, F\right)$ be a deterministic finite-state automaton. Show that the language recognized by $M, L(M),$ is infinite if and only if there is a word $x$ recognized by $M$ with $l(x) \geq|S|$ .
Modeling Computation
Language Recognition
(a) For every language L over Σ at least one of L and L^C is Turing-recognizable. (b) If languages L_1 and L_2 over Σ are both regular with L_1 ⊆ L_2, then a language L that is sandwiched between them, that is L_1 ⊆ L ⊆ L_2 is Turing-recognizable. (c) For every language L over Σ that is Turing-recognizable, at least one of L and L^C is Turing-decidable. Prove the following statement: (d) Let T_1 and T_2 be Turing Machines such that L(T_2)^C ⊆ L(T_1). If, on every input word w, T_1 takes longer to compute than T_2, then L(T_2) is Turing-decidable.
Adi S.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD