Given that L is a language accepted by a finite state machine, show that LP…

PYQ GATE 1997

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 is obtained by reversing some string in L}.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…