GATE | GATE CS 1997 | Question 65

Given that L is a language accepted by a finite state machine, show that L^P and L^R 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 }

Answer:

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save