YI Homomorphism Innersehomomorphosins

for diff type of RE Languages

D C Rogen

Substitutions
I 2 D alphabet
a La

SCE E
S sea Scn scaj set E
aC E
S C4 Users
NGL

substitution to a
By
applying given
Regularlanguage we can get a new
language
a
Is substitutions
a
of Regular language
regular language
yes
On reading a I will
simulate Ma if find
7 Mat State is reelhed then
I reach q
 O O reach q
This new DFA accepts the

language say

Rls Pno
Shuffling of

Decisionpno blems

fix property P of a languages

ills Regular language LC DFA NFA
C NFA R E

gp Dees L have
property P
Yes No

EMPTINESS
 7 I

ills RE R
01ps Is LCR empty
tht Give a machine to answer above
question that terminates in finite
no
of Steps
Of
EMPTY C G Yes
age EMPTY a No AEE Innihletor
use Mo
Empty E
EMPTY Rts EMPTY R A EMPTY CD
EMPTYCRM No
EMPTY CR.sk EMPTY CR EMPTY log

of ills DFA
off Is LCR empty

use BFS to mark

every slate
from start stale
If F a final slate reachable
from start state their language
not empty
else
empty
 else
empty

MEMBERSHIPT
L EE
it p 7
neg lay
w

Does wth
gp
1 Simulele w on the
given machine

EQUALITTHP
T L LL
s
ref Cary
Is 4 4
off
Algy G L D Lz L REDUCE ALY
LL Yes thin L Lz
p EMPTY
else No

FINITENESI

ills L
ang hey
ofpi Is 14 Cd
cardinality

Thru o
L is a RL L is
infinite
 L as a R L is a
finite
f EL 2 M Eliot 2n
iff
w

n is stales
M
no
DRA
of L
for
Knoff

By RL
w can be
partitioned into
t
My
2
Ingle n ly l l
t k
Nyk 2 C L
Hence L i's infinite

As L is infinite then f is C L
S t l WI m
w is shortest such string
to C2n
pnone.tw
Assume full 72M
By PL
G ng z 2 n
heyl
18171
EL
Kyke
he 0
EL
neg 2
Intl lol
so 7 a shorter than us
string
 so I a string shoot 1 w
fennec Assumption is
wrong
then I WIL 2n

Belterwayt
Throw all Stales not weather.be
from stale
start
States to
Throw an not
leading
final Shale
cheek C
if 7 a non
cycle
in the machine
Lies
if else
yes No