YI
Innersehomomorphosins for diff type of RE Languages D C Rogen
Homomorphism
Substitutions 2
I a
La
SCE
E
S
sea
S
C4
alphabet
D
Scn
set E aC E
scaj
Users NGL
By
applying Regularlanguage we Is
can
substitutions a
to a
substitution
get
a
given language
new
a
of Regular
regular language
language
yes On reading a simulate Ma 7
Mat
State I
is
reach
I will
if find
reelhed then
q
O
O new
This
reach
q
DFA accepts the
language say
Shuffling of
Decisionpno
Rls
Pno
blems
fix property P of a languages ills Regular language LC DFA C
gp
Dees
EMPTINESS
L
have
NFA
NFA R E
property
P
Yes
No
7
I
RE R
ills
tht Give
LCR
Is
01ps
machine
a
question
EMPTY C G EMPTY
a
Rts
EMPTYCRM EMPTY CR.sk
of
ills off use
from
in
finite Of
AEE
Innihletor
EMPTY R A EMPTY CD No
EMPTY CR
DFA LCR
Is
BFS
If F from
above
answer
terminates of Steps
Yes No Mo
Empty E EMPTY
to
that no
age use
empty
to
start a
empty mark stale
final slate
start
not empty else
EMPTY log
empty
state
every
slate
reachable their language
else
empty
MEMBERSHIPT
it p
L
7
neg wth
Does
gp
Simulele
1
w
w
lay the
on
EE
given machine
EQUALITTHP T
L
s
Is
off G L
Algy
LL
4
ref Cary 4
L
D Lz
LL p EMPTY
else
REDUCE ALY thin
Yes
L
Lz
No
FINITENESI ills
L
ofpi
Thru
o
Is
ang hey
14
Cd
cardinality L is
a
RL
L
is
infinite
L
f
iff
R
a
as
L
EL
w
is
n
M
Knoff By RL w
of DRA no
L
for
be
t
k
Hence
L is
infinite S t
is
w
to
Assume By PL
L
2 Nyk i's
pnone.tw
My C L
infinite
then f m l WI
shortest
2n
stales
partitioned into t n ly l l Ingle
can
2
As
Eliot
M
2
finite
a
is
is C L
such string C2n
full 72M G
ng
z
heyl
EL Kyke he 0
neg 2
EL
Intl
so
7
a
string
2 n
18171
lol shorter
than us
so
I a fennec
then
string
shoot
Assumption I WIL 2n
1
is
w
wrong
Belterwayt Throw
from
all
Stales
not
weather.be
stale to an not States Throw leading final Shale C non a cheek if 7 cycle in the machine Lies if else yes No start