Introduction To Computer Theory by Cohen Solutions

Manual
scribd.com/document/655101727/Introduction-to-Computer-Theory-by-Cohen-Solutions-Manual

Ziyaad Fredericks

To

_SESOND

EDITION

SoLuTions

MANUAL

1/177
2/177
3/177
Digitized

by

the

Internet

Archive

In

2022

with

funding

from

Kahle/Austin

Foundation

https://archive.org/details/solutionsmanualt0000bren

4/177
5/177
TO

ACCOMPANY

SECOND

EDITION

DANIEL

I.

A.

COHEN

Hunter

College

City University

of

New

York

Prepared

by

CHANAH

BRENENSON

John

Wiley

&

Sons,

Inc.

6/177
7/177
Chapter

Chapter 2

Chapter

Chapter

Chapter

Chapter 6

Chapter

Chapter

Chapter 9 Chapter

10

Chapter

11

Chapter

12

Chapter

13

Chapter

14

8/177
Chapter

15

Chapter

16

Chapter

17

Chapter

18

Chapter

19

Chapter

20

Chapter

21

Chapter

22

Chapter

23

Chapter

24

Chapter

25

CONTENTS

9/177
_

“4

CHAPTER

The

main

goal

of

this

chapter

is

to

give

at

least

vague

idea

10/177
of

what

Computer

Theory

might be

and

why

it

might be

studied.

This

course

is

often

required

of

all

majors and

so

they

enrol

without

even

the

usual

11/177
pretense

of

acting

volitionally.

Unlike

courses

offering

programming

skills

this

one

is

not

primarily

vocational

it

is,

of

course

indirectly

of

benefit

to

the

art

12/177
of

programming

but

it’s

main

thrust

is

intellectual

enrichment.

Plumbers

may

not

know

exactly

who

invented

plumbing

but

they

do

know

why,

and

perhaps

how,

13/177
it

came

about. For

all

their

mental

achievements

programmers

generally

have

no

basis

for

answering

this

same

question about

their

profession.

Computer

Science

majors

are

very

suspicious about being

14/177
slipped

extra

theoretical

math

courses

under

the

guise

of

"this

will

be

good

for

you

somehow."

To

allay

this

fear

we emphasize

that

this is

not

15/177
course

in

mathematics

as

such

but

course

in

mathematical

models,

friendly

technique

that

arises

in

social

science

and

linguistics

and

other

unthreatening

subjects.

16/177
Of

course,

this

is

course

in

mathematics.

Haha.

But

the

joke

is

more

on

the

mathematical

community

who

have

no

idea

what

beautiful results

lie

17/177
in this

disenfranchised

corner

of

their

discipline

--

this

despite

the

fact

that

its

grandfathers,

Hilbert,

Gédel, Church,

von

Neuman

et

al.,

are

held

in

reverence

for their

18/177
other,

more

“pure”

contributions.

In

general

the

format

of

this text

is

in

the

classical

theorem-proof-theorem-proof

model,

but

unfortunately

most

students

who

need

to

know

the

19/177
material

in this

course

are

(functionally)

mathematically

illiterate.

Even

if

they

have

been

forced

to

take

course

in

Calculus

or

Linear

Algebra

they

have

almost

20/177
no

conception

of

what

it

means

to

prove

anything.

Worse

yet,

they

are

afraid of

ever

being responsible

for

constructing proofs

themselves.

This

book

is

realistically

sensitive

to

21/177
this

deplorable

situation

and

it

takes great

pains

to

assuage

such

anxiety.

This

is

gentle

introduction

to

the

art

of

providing

convincing

explanations

(i.e.

proofs)

22/177
for

proposed

propositions

that

may

even

usefully

serve

as

primer

for

those

math

majors

who

suffer

from

proof-anxiety.

For

the

student

who

is

more

23/177
sophisticated

mathematically

there

are

other

texts

which

cover

approximately

this

same

material

in

many

fewer pages.

Some

of

these

books

are

excellent.

We

can

recommend,

without

24/177
reservation,

the

following

list

from

our

own

experience: Hopcroft

and

Ullman, Lewis

and

Papadimetriou,

Mana,

Harrison, Kain,

Minsky,

etc.

No

claim

is

made

that

this

list

is

exhaustive

25/177
and

there

may

be

many

more

texts

of

recent

vintage

of

which

we

are

unaware.

Students

should

be informed

about

these

books

as

possible

other

sources

26/177
of

reference,

though

they

should be cautioned

about

the vast disparity

that

may

exist

in

notation

and

be

alerted

to

possible

subtle

differences

in

definitions.

If

any

of

these

27/177
books

are

approached

they

should be

refrom

page

one.

Before

our current

book was

released

there

was

some

confusion

as

to

whether

the

books

listed

above

were

texts

28/177
for

graduate

courses

or

undergraduate

courses.

There

is

strong

feeling

that

Computer

Theory

should

be

taught

to

undergraduates,

especially context-free

grammars

a topic

29/177
and

notation

that

appears

importantly

in

other

undergraduate

courses such

as

compilers,

Al

etc.

However,

graduate

level text

does

not

become

an

undergraduate

level

text

simply

30/177
by

reading

it

slowly.

Even

though

it

is

certainly

true

that

the

books

listed

above

are

more

advanced

this

does

not

mean

that

they

contain

31/177
everything

of

value

that

is

in

our

text.

There

are original

contributions

to

be found

among

these

pages,

not

original

theorems

but

some

new

ideas

in

the proofs,

32/177
some

original

problems,

some

useful

examples

and

many

instances

where

an

idea

that

is

only

vaguely

sketched

in

other

sources

is

made

explicit

here.

(Sometimes

33/177
making

an idea

explicit

can

seem

painful

or

frightening, but

there

is

always what

seems

to

us

good

justification for

giving

student

more

than

just

the

impression

34/177
that

she

knows

what

is

going

on.)

If a

student

finds

this

book

easy,

let

her

read

through

it

quickly.

There

are

600

pages

here

and

35/177
no

one

is

going

to

read

it

over

night,

but

we

believe strongly

that

bright

student

should be

encouraged

to

set

her

own

pace. For

the

strongest

36/177
foundation

in

this

subject

one might

start

by

finishing

this

book

and

then

read

one

(or

all)

of

the

texts

mentioned

before.

student

who

approaches

37/177
the

more

advanced

books

already

knowing

most

of

the

material

in

them

(our

material)

will

not

only

have

an

easier

time

reading

but

will

develop

38/177
an

appreciation

for

the

power

of

the

advanced

mathematical

notation

for

its

efficiency

and

Clarity

of

abstraction.

We

generally

avoid

advanced

mathematical

notation

for

two reasons:

39/177
psychological

and pedagogical.

The

fear

and

alienation

engendered

by

page

of

symbols

more

than

neutralizes

the

efficacy

of

introducing

the

notation

as

it

defeats

the

40/177
purpose

of

education.

It

is

also

true

that

far

too often

student

(or

professional

mathematician)

gets

a false

sense

of

confidence

in

the

material

by

41/177
merely having

followed

the

manipulation

of

the

symbols

on the

paper.

We

have

too

frequently heard,

"I

followed

everything you

did

in

class

but

couldn't

do

the

problems."

42/177
It

is

our

belief

that

the

hasty

adoption

of

abstract

notation

is

largely

responsible

for

this

predicament.

Notation

should

be introduced

only

when

student

feels

43/177
that

her

thoughts

are

flying

faster

than

her

ability

to

express

them. At

that

point

students should be

encouraged

to

invent

their

own

personalized

shorthand

bearing

their

own

44/177
private

meanings.

Only

as

final

stage,

when

the

need

for

standardized

medium

of

communications

becomes

clear,

should

symbolism

be

introduced.

The

important

mistake

45/177
not

to

make

is

to

feel

that

subject

becomes

more

rigorous,

more

precise

or

more

mathematical

because

it

is

riddled

with

symbols.

Greek

letters

46/177
are

no

more

exact than

the

English

words

that

defined them.

Many

shoddy

proofs

go

undetected

because

they

are

disguised

in

opaque

notation.

If

an

argument

is

47/177
rigorous

in

symbols

it

remains

rigorous

when

expressed

in

English

sentences.

What

it

takes

us

600

pages

to

do

here

could

have

been

condensed

to

48/177
fifty

--

with

complete

loss of

educational

value.

49/177
50/177
51/177
CHAPTER

It

is

important

to

distinguish

for

the

student

what

material

from

this

chapter

will

be

required

in

the future

and what

will

not.

Obviously

52/177
the

silly

languages

L,,

L,,

L,

and

are

not

important

for

the

rest

of

the

book,

though

they

do

reappear

briefly

in

Chapter

3.

53/177
On

the

other

hand

the

language

PALINDROME

must

become

member

of

our

immediate

family.

big

fuss

should

be

made

about

the

word and

the

54/177
Kleene

star.

We

have

found

that

Theorem

is

good

introduction

to

the

concept

of proof.

We

challenge

the

students

to

provide

"an

explanation

of

55/177
why

this

is

true

that

would convince

someone

who

didn't

already

believe

it."

There

is

usually

some

obliging

student

in

the

class

who

doesn't

understand

the

56/177
result

and

when

the

other

students

try to

convince

him

that

it

is

not

only

true

but painfully

obvious

he

is

sometimes

able

to

shake

their

confidence

57/177
in

their ability

to

articulate

their

thoughts.

This

is

the

beginning

of

the

understanding

of

what

proof

is

all

about.

have

assumed

throughout

the

book

58/177
that

the

readers

are

acquainted

with

standard

elementary

computer

programming

concepts

such

as

the

notion

of

formal

strings

of characters,

concatenation, prime

numbers,

factorials,

symbolic

logic,

etc.

59/177
Other

than

that

the

text

is

so

self-contained

that

it

defines

many

terms

the

student

is

already

familiar

with.

What

could

be

the

harm?

It

60/177
is

our

habit

to

give exactly

20 questions

per

chapter

many

of

which

have

multiple

parts.

Problem

20

is

usually

more

theoretical

in

nature

and

often

61/177
quite

challenging.

Sometimes

#20

is

so

difficult

that

it

contains

hint

that

gives

virtuaily

the

whole

problem

away.

This

#20

is

not too hard.

62/177
63/177
64/177
Chapter

Two

S*

has

2-letter

words,

3-letter

words

and

2"

n-letter

words.

words

of

length 4;

words

of

length

13; 13

words

65/177
of

length

6.

In

general,

the

number

of

words

of

length

is

the

sum

of

the

number

of

words

of

length

(n-1)

and

the

66/177
number

of

words

of

length

(n-2),

Fibonacci

sequence.

length

2:

ab,

ba; length

4:

abab, abba,

baab,

baba;

length

6:

ababab, ababba, abbaab,

abbaba, baabab, baabba, babaab,

bababa;

S*

contains no

words

67/177
of

odd

length,

and

no

word

containing

riple

letter

substring.

The

smallest

word

not

in

this

language

is

a.

The

string

abbba

is

not

68/177
in

the

language.

length

1:

a;

ength

2:

aa,

ab,

ba; length

3:

aaa,

aab, aba,

baa;

length

4:

aaaa,

aaab, aaba, abaa, abab, abba,

baaa, baab,

baba;

length

5:

aaaaa,

69/177
aaaab, aaaba, aabaa,

aabab, aabba, abaaa, abaab,

ababa,

abbaa, baaaa, baaab, baaba,

babaa;

length

6:

aaaaaa,

aaaaab, aaaaba,

aaabaa, aaabab,

aaabba, aabaaa, aabaab,

aababa,

aabbaa,

abaaaa, abaaab, abaaba, ababaa,

ababab,

ababba, abbaaa, abbaab,

abbaba,

baaaaa, baaaab, baaaba, baabaa, baabab, baabba, babaaa, babaab,

bababa;

This

language

is

all

the

strings

70/177
of

a's

and

b's

where

each

has

its

own

its

left

or right.

No

two

b's

may

share

the

same

a.

Factoring

gives:

71/177
aa|baa,

baa\aba\aa,

baa\aa\aba\baa\aa

No

word

can

be

factored

in

more

than one

way

(look

for

the

first

odd

length

substring

of

a's

and/or

the

position

of

72/177
the

first

5).

No

word

can

have

an

odd

number

of

a's

because

each

factor

contains

two.

(xxx)

and 8 (xx)- 9

arrangements

(nine

choose

one)

73/177
(xxx)

and

(xx)-

56

arrangements

(eight

choose

three)

(xxx)

and 2 (xx)-

21

arrangements

(seven

choose

five)

total

86

arrangements

(i)

To

determine

if

74/177
string

is

palindrome:

1) Ifthe length

(string)

<

then

the

string

is

palindrome,

otherwise

continue.

2)

Compare

the

first

letter(s)

with

the reverse

of

the

last

letter(s).

75/177
If

they

match

then

delete

them

both and

repeat

step

1.

Since

is

palindrome,

reverse(x).

Following

the

algorithm

to

test x",

two

copies

of

76/177
x

are

repeatedly

deleted

(one

from

each

end,

because

they

match)

until

the

string

is

reduced

either

to

(when

even)

or

to

77/177
x

(when

odd).

Both

of

which

are

palindrome,

therefore

x"

is

palindrome.

(ii)

If

tring

is

palindrome,

then

deleting

an

equal

number

78/177
of

letters

from

the

both ends

leaves

palindrome

word.

Hence,

removing

the

front

and

rear

copy

of

from

y°

which

is

palindrome,

leaves

the

79/177
palindrome

string

y.

80/177
81/177
82/177
10.

ee

12,

Chapter

Two

(mi)

Continuing

the

proofs

above

applied

now

to

the

palindrome

string

z,

repeatedly

remove

two

copies of

at

83/177
time,

one

from

either

end,

until if

is

odd

only

palindrome

string

remains.

Ifn

is

even,

then

stop

shrinking

the

string

when

zz

84/177
remains.

Note

that

any

palindrome

can

be

viewed

as

tring

concatenated

with

its

own

reverse.

zz

is

palindrome

and

zz

reverse(z), implies

that

85/177
z

reverse z)

and

palindrome.

iv)

The

are

four

palindromes

of

length

3;

aaa,

aba,

bab,

bbb

and of

length 4; aaaa,

abba,

baab, bbbb.

For each

odd

86/177
length

palindrome

insert

another

copy

of

the

middle

letter

adjacent

to

it

to

make

an

even

length

palindrome.

(v)

By

using

the

algorithm

in

part

87/177
one,

we

can

reduce any

palindrome

to

central core

of

one

or

two

letters.

On

{a,

b},

there

are as

many

palindromes

of

length

(aa,

bb)

88/177
as

there

are

of

length

(a,

b).

To

make

palindromes

of

length

2n,

choose

core

of

length

2,

and

then

make

n-1

choices

89/177
for

the

letters

to

the

left

which

determine

the

letters

to

the

right.

To

make

palindromes

of

length

2n-1,

choose

core

of

length

90/177
and

then

make

n-1

choices

for

the

other

letters.

In

each

case

choices

determine

the

word.

Since there

are

two

choices

for

letters,

there

are

91/177
2"

palindrome

words

of

length

2n

or

2n-1.

Here

is

an

algorithm

for

finding

z.

1)

If

length(x)

length(y).

Then

we

have

palindrome

92/177
of

even

length,

so

it

must

be of

the

form

reverse(z),

and x=y=z.

2)

Ifthe

strings

are

of

different

lengths then

the

longer

one

either

begins

or

93/177
ends

with

the shorter

one.

That

is

if

length(x)

<

length(y) then

xy

xsx,

where

sx,

and symmetrically

if

length(x)

>

length(y)

then

xy

94/177
ysy

where

ys.

In

both

cases the

substrings

are

palindrome

(because

they

are

each

the center

of

palindrome).

In

addition, the

longer

string

95/177
is

palindrome

that

is

the

concatenation of

two

palindromes,

so

repeat

algorithm

on

L.

(i)

Sc

T,

so

S*c

T*.

5bbd

is

the

only

word

in

96/177
T

but

not

in

S.

However,

bb

so

bbbb

e€

S*

and

T*

S*,

therefore

S*

T*.

(ii)

Sc

T,

so

97/177
S*c

T*.

However

there

is

no

way

to

generate

bbb

with

the

elements

of

S,

so

Si71

Tt.

(iii)

S*

T*

even

though

98/177
#

only

when

all

the

words

in

the

symmetric

difference

can

be

generated

by

words

in

the

intersection.

No

changes

in

the equalities

and

inclusions.

99/177
i)

(S*)*

includes

even

is

does

not,

so

(S*)*=

S*.

S*

S**

by

Theorem

1. (ii)

There

can

be

no

factor

in

(S*)

100/177
that

is

not

in

S*, (S*)

cS’.

In

general,

any

set

is

contained

in

its

positive

closure,

S*

<

S*)’.

Therefore

(S )’

S”.

iii)

Yes.

101/177
IfA

S, then

S*

S*.

(S*)*

(S*)*

(S*)*.

IfA

then

S*

anyway,

and

(S*)

= S*)*

S*=S*UA

S*)*.

No

words

102/177
in

S*

contain

an

odd

number

of

b's

(each

factor

contributes

two

if

any),

so

none

of

the

examples

is

in

the

set.

103/177
104/177
105/177
Is.

14. 15.

16.

We

18. 19:

20.

Chapter

Two

This

is

the

same

as

saying

that

the

language

would

allow

all

concatenations

that

did not

106/177
produce

squares.

First

observe

that

A=

AA,

so

cannot

be

in

the

language.

Consider

Ww,

andw,w,€L.

Letw=ww,

sinceA€

l,

wW#w,

sow

=Www,

107/177
€L where

W,

W,,

finally

let

w,

w,w,

€ L.

However,

w;

w,w,w,W,

W3W;

Which

is

square

so

ws

L.

(S**)*

108/177
=

(S*)*

S*

by

Theorem

1.

It

is

often

bigger

than

S.

(i) no.

(ii)

yes.

T=S+

w}

>

we

>

we

T%*

and

109/177
T*

S*

>

we

S*

Let

{aaa},

S*

has

one

six-letter

word

and

no

seven-letter

words

nor

eight-letter

words.

However

it

is

110/177
impossible

for

S*

for

any

to

contain

more

six-letter

words

than

twelve-letter

words

because

for

every

six-letter

word

there

is

twelve-letter

word

111/177
ww

in

S*.

(i)

All

words

over

&

{a,

5}

of

even

length.

(ii)

aa,

aab, aba, abb, baa, bab, bba,

bbb

(iii)

All

strings

112/177
of

a’s

and

b’s

except

(iv)

S* and

T*

both

represent

the

set

of

all

strings

of

a's

and

b's.

Therefore

must

include

at

113/177
least

the

words

and

b,

which

is

the

set

S.

(v)

S={a,

bb},

T=

{a,

aa,

bb

}.

The

word abaaba

disproves

the

algorithm.

Since

114/177
T

is

closed

and

T, any

factors

in

concatenated

together

two

at a

time

will

be

word

in

T.

Likewise

concatenating

factors

in

115/177
S

any

number

of

times

produces

word

in

T.

That

is

any

word

in

S*

is

also

in

T.

However

we

are

given

that

116/177
T

S*

so

contains

some words

that

are

not

in

S*.

We

can

conclude

that

S*

is a

proper

subset

of T,

in

other

words

S*

117/177
is

smaller

than

T, and

in

symbols

S*

T.

118/177
119/177
120/177
CHAPTER

Computer

Science

majors

are familiar

with

the

term "recursive

programming"

and

this

will

be

very

helpful

with

the

concept

of

recursive

definitions.

The

same

121/177
idea

of

self-reference

is

not

carried

over

directly to

"recursively

enumerable"

since

that

is

back

formation from

"recursive

functions."

Students

should

be

told

not

to

worry

122/177
that

the

mathematical

examples

of

polynomial

and

derivative

set

precedent

of a

strong

connection

between

this

course

and

mathematical

analysis.

These examples

are

just

too

perfect

123/177
not

to

have

been

included.

if

Calculus

were

properly taught

the

concept

of

recursive

definition

would

have

been

introduced

there.

Theorems

2,

and

are

124/177
simply

illustrations

of

the

theorem-proving

power

of

recursive

definitions.

They

also

serve

as

pre-introduction

to

parsing.

The

discussion

of

well-

formed

formulas

is

also

125/177
tangential

to

the

material

in

the

text

but

computer

students should

have

mastered

this

useful

tool

by

this

time

in

their

education.

Why

have

we

defined recursion

126/177
but

avoided

all

reference

to

proof

by mathematical

induction.

The answer

is

simply

that

we

hate

proofs

by

mathematical

induction.

They

verify

the

truth

of

result

127/177
without

shedding

any

understanding

of

why

the

claim

is

true

or

where

it

came

from.

It

is

fine

tool for

research

but a

poor

one

for

128/177
education.

It

is

employed

by

lazy

authors

who

wish

to

compress

as

many

results

into

as short

space

as

possible.

The

benefit

of

this

in

129/177
a

textbook

is

mystery

to

me.

Chapter

Three

Rule

1:

xismL,

Rule

2:

[fw

is

in

L,

then

so is

wx.

There

are

130/177
eleven

ways

to

prove

that

14

is

even.

2+2=4

4+2=6

4+4=8

6+2=8 6+4=10

6+6=12 8+2=10

8+4=12

eS

8+2=10

8+4=12 8+6=14

0+

=12

10+4=14 12+2=14

131/177
10+2=1210+4=14

12+2=14

10+2=12

10+4=1412+2=14

12+2=14 1242-14

12+2=14

2>4=>8

16

32

64

96

100:

teps.

To

show

that

2n

is

in

EVEN:

Keep

132/177
adding

to

itself the largest

number

in

the

set

until

the

first

result

that

is

greater

than

or

equalto

n.

Ifthe

result

equals

then

adding

it

133/177
to

itself

gives

2n.

If

he

result is

greater

then

n,

add

to

it

the

largest

value

in

the

set

that

will

not

bring

the

total

134/177
above

2n.

Continue

this

procedure

until

adding

that

value gives

the

result

2n.

We

must

show

1)

that

all

positive even

numbers

can

be

produced

from

this

135/177
definition

and 2)

that

the

definition

produces

nothing

else.

1)

We

have

and

and

2+4=6, 4+4=8, 6+4=10, 8+4=12,

...,

so

if

here

is

an

even

number

that

136/177
cannot

be

produced

from

this

definition

it

is

large.

Let

us

suppose

that

there

are

some

such

numbers

and

let

us

call

the smallest

of

them

137/177
n,

(that

is

is

the smallest

even

number

that

cannot

be

produced

from

this

definition).

But

that

means

that

all

smaller

even

numbers

can

be

138/177
produced

by

this

definition,

and

in

particular,

that

n-4

can

be

produced. So

to

produce

n,

we

apply

rule

Rule

to n-4.

Since

there

is

no

139/177
smallest

even

number

that

cannot be

produced

from

this

definition,

all

even

numbers

can.

2)

How

can

we produce

an

odd

number

from

this

definition?

If

we

140/177
add

an

even

number

to

some

arbitrary integer

the resulting

sum

has

the

same

parity

as

n.

The

increment

in

the

definition,

4,

is

even.

Both

141/177
of

the

elements

known

to

be

in

the

set

(2

and

4)

are

even.

10.

Chapter

Three

Therefore

application

of

Rule 2

will

never

142/177
alter

the

parity,

and

all

numbers

in

the

set

will

be

even.

We

can

make

up

any

rules

as

long

as

they

do

not

change

143/177
the parity

and

providing

that

they

cover

all

cases.

If

ule

lists

the smallest

even

numbers

and

the

increment

in

Rule

is

2n

(the next

144/177
highest

in

the

set),

both

conditions

are

met.

There

are

infinitely

many

such

lists

of

rules.

Use

the

following

recursive

definition

of

EVEN:

Rule

1:

145/177
2, 4,

6,

8 and

10

are

in

EVEN.

Rule

2:

Ifx

is

in

EVEN

then

so is

10.

Since

adding

10

never

changes

the

last

146/177
digit

of

the

number,

all

numbers

in

the

set

end

in

0, 2,

4,

6,

or

8.

This

defintion

satisfies

the

conditions

in

the

answer

to

147/177
Problem

5,

so

it

will

not

allow

change

of

parity

and

covers

all

cases.

Rule

1:

Any

number

is

in

POLYNOMIAL.

Rule

2:

The

variables

148/177
x

and

are

in

POLYNOMIAL.

Rule

3:

If

and

are

in

POLYNOMIAL,

then

so

are

a+b,

a-b,

(a)

and

ab.

(a)

149/177
is

nm

ALEX

(Rule

1).

is

in

ALEX

(Rule

2).

3x

is

ALEX

(Rule

3).

in

ALEX

(Rule

1).

x+2

is

150/177
in

ALEX

(Rule

3).

Therefore

by

ALEX

Rule

1,

x+2

and 3x

are

both

ALEX.

Since

x+2

is

ALEX,

by

Rule

2a,

so is

(x+2) and

151/177
by

Rule

2g,

so

is

(x+2)™.

(b)

Elementary

calculus

contains

rules for

differentiating

sums,

differences,

products,

quotients,

and exponetiations

of

differntiable

functions.

By

the

rules

given

here,

152/177
if

these functions

are

polynomials,

they

are

composed

only

of elements

that

are

differentiable

functions

and

are

therefore

differentiable.

(c)

No,

when

it

is

matter

of

153/177
polynomials,

the

permissible

functions

are

all

defined

in

the

other

rules.

(((((3)x)+7)x)-9)

contains

only

two

products:

the

product

of

and

and

the

product

154/177
of

(((3)x)+7)

and

x.

x?

xx

(one

step)

x)?

xtex8

(four

steps)

xx’

(two

steps)

x8

xx"?

(five

steps)

—=

155/177
x2+x?

x4

x2

xx

xx

(three

steps)

x5

xex?xtex8

(six

steps)

x°

x*>x*

X=

xhex®

(four

steps)

x’

x-x?-x"

(four

steps)

156/177
x7

xx

(seven

steps)

=x

Xx

(three

steps)

x8

x?-x76

x-x*

(four

steps)

xl?

xex?-x

(six

steps)

x10

x2.x8 x70

157/177
x4.x/8

(five

steps)

x)

x-x?-x

(five

steps)

x7)

xxx

(six

steps)

10

fa 2.

LS:

14.

16.

17.

18.

Chapter

Three

158/177
x2?

x2-ytx/6

x77

x+x7x-x/6

(seven

steps)

x3

xx4.x6

(seven

steps)

xe

x*ex8-x16

(six

steps)

m=

x®.x/6

(five

steps)

x-x*+x®-x °

(seven

steps)

x?

159/177
=

x-x8-x °

(six

steps)

x00

Pex4exFx?

x26

x?’

xlé

Forbidden

substrings

of

length

2:

++

-+

“4

/+

(+

160/177
;

+/

-/

(/

es,

’)

/)

()

Forbidden

substrings of

length 3

that

do

not

contain

shorter

frobidden

substrings:

re

Sie

fee

161/177
(ee

toto

Not

without

very

careful stipulation

of

many

contingencies.

It

is

much

more

practical

to

allow

them

to

accumulate

and

eliminate

redundancy

in

(or

reduce)

162/177
the

configuration

later.

(i)

Rule

1:

Any

letter is

in

Prep-Calculus

Rule

2:

Ifx

and

are

in

Prep-Calculus

so are

(x),

~x,

x/A y,

xV

y,

x>

163/177
y.

CG

SK

18

Cala (mea

Gs

~)

BN

es

V)

YVR

N= \)

WN

SENN

KH

+)

SN SA

Ss

(i)

Rule

1:

a,

164/177
b

and

are

in

PALINDROME.

Rule

2:

Ifx

is

in

PALINDROME,

then

so are

xx, axa,

and

bxb.

(i1)

Rule

1:

aa

and bb

are

in

EVENPALINDROME.

165/177
Rule

2:

If

in

EVENPALINDROME,

then

so

are

xx,

axa,

and

bxb.

(i)

Rule

1:

is

ODD.

Rule

2:

Ifx

is

in

ODD,

166/177
so is

x+2.

(ii)

Rule

1:

1,

2, 3, 4,

5,

6, 7,

8 and

are

in

DIGITS.

Rule

2:

Ifx

and

are

in

DIGITS

then

so are

x0

167/177
and

xy.

This

is

the

set

of

positive

rational

numbers.

Starting

with

Rule

and applying

addition,

we

get

the

positive

natural

numbers.

Then

applying

x/y,

168/177
we

get

all

the

fractions.

Def

1.

Rule

1:

is

im

POWERS-OF-TWO.

Rule

2:

If

x is

in

POWERS-OF-TWO,

so

is

Def

169/177
2.

Rule

1:

and 2

are

in

POWERS-OF-TWO.

170/177
171/177
172/177
173/177
174/177
175/177
Reward Your Curiosity
Everything you want to read.

Anytime. Anywhere. Any device.

No Commitment. Cancel anytime.

176/177
177/177