Skip to content
Related Articles
Open in App
Not now

Related Articles

GATE | GATE CS 1997 | Question 65

Improve Article
Save Article
  • Last Updated : 30 Oct, 2017
Improve Article
Save Article

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 }


Answer:

Explanation:

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

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!