Question 10092 –
February 13, 2024Question 10097 –
February 13, 2024Question 10096 –
Given that L is a language accepted by a finite state machine, show that LP and LR are also accepted by some finite state machines, where
LP = {s|ss’ ∈ L, for some string s’}
LR = {s|s obtainable by reversing some string in L}
Correct Answer: A
Theory Explanation.
Subscribe
Login
0 Comments