Lec 2.pdf

ME

Given

f f L

i

Given

L

of

all

strings

i

e

string

L

solves M

by

accepting rejecting

accept

off

Lm his

m

F.IT

m

has

hes a

a

Anime factor Is CK

prime factor lock

deciding

Kjell fAccett

FAEianhitema.ee

Iste PDAtabrine loop forever TM

ne

KE Z

Comton I

LE

NEL

problem Machine

L E It to language

accept reject subset

a

n

n

2

2 E

language

ifgo

find prime factors of

Finite Automata Simplest describes

class

Operation

of

finitely many

REGULAR languages steles

change slates in response to ills accepts ills by ending up in final or accepting steles

Stale

transition

diagram

Stale reef resealed by start

final

Steele

only single Multiple final stale possible

i

Steele

transition Ctranghintifogs

9

steles

at 2

f

ab

Pfp

KEEP

input

Are steles

Pr

Pi P

958 Litany strings

Mp L Check

a

nay WE 0,13

if

the

1

my C co has

input contains

o

B

a subshing a

di

Substniy

Ol

FAI

f f

M

exhaust

the

pi

ills

g

to

X

to

011

0

On I Ac cepts 87 if

accepting final it reaches the end

it is

when

else

M

f

in

it

stale

stales s

Start

EE 9,8

readable

LCM

Steele

rejects

all

G PI s O

a

of

ilp

set

above machine

Aceto

L

1110000

symbolslatpheb.US

9

WE 2

see

transition ytransition

dynamic

of find

119 accepts

steles

w

function

set

le

a

33

1

contains three

n

consecutive a's

me

atb

I

e

b

2

at

a b

atleast 3 ab

contains

n

a

I stag

in

L

a b3

a c

coulais

se

even no

of a's

s e

e

eO

MT

um o

o e

g

o o

even

no

of

1s

I

B he

at

E

represents 3

O

multiple in binary a

remainder

ei f 99

c

2ft c

I c

mod 3

O l Z O

µich

of 2 I O