Given ME

find prime factors of n

f 2 2
f i E accept reject L E It
to
language
L all
language subset of strings i e LE
ifgo n a string
NEL
problem

Machine solves L accepting rejecting ne

by
Given M KE Z
accept off m hes a Anime factor Is CK

L Lm his m has a
prime factor lock

Comton
deciding
I
F.IT FAEianhitema.ee
fAccett
Kjell
Iste PDAtabrine loop forever
TM
 Finite Automata

Simplest
describes class REGULAR languages
of
Operation
finitely many steles
change slates in response to ills
accepts ills by ending up in a

final or accepting steles

Stale transition diagram

Stale reef resealed by

start Steele i only single
final Steele Multiple final stale possible
transition at 2
f
Ctranghintifogs ab input
KEEP
Are steles

Pfp Pr
9 Pi P 958 Litany
steles strings

Mp nay my C o B
di
L WE 0,13
1 co has a subshing

Check if the input contains a

Substniy
 Ol
0 011 to exhaust
FAI f pi
the ills
M f g
to
X
On
I
L Aceto above
1110000 machine

Ac cepts 87 if it is inaccepting final

a Steele
when it reaches the end
of
ilp
else it
rejects

all
set stale
f stales Start
transition ytransition
EE 9,8 dynamic
M G PI s function
readable
symbolslatpheb.US see
of find steles
s O 9
LCM WE 2 119 accepts w
 le set a 33
1 n contains three
consecutive a's

me atb

I
e

2 at a b n contains atleast 3 ab
a

in I stag
L a c a b3 coulais
se even no
of a's

e e
eO

MT um
o even 1s
no
of
o e o o
g
 I

at B he represents a multiple of
3 in
binary
E O

remainder 2 I O

ei
f 99 c
2ft c mod 3
I O l Z
c O

µich