let L be a regular language of binary strings.
let L* be another language such that (x:x belong to L and x ^ R belong to L) where x ^ R is the reverse
show that L* is also regular
Printable View
let L be a regular language of binary strings.
let L* be another language such that (x:x belong to L and x ^ R belong to L) where x ^ R is the reverse
show that L* is also regular
The idea here is to make a new automaton which computesand
simultaneously, such that it will enter an accepting state iff both