1022-1020 :

( )transmitted)transform )
()participation . :
, .
" "automaton
( )abstract :

:
.1( :)Input ( t1, t2, t3.. )discrete instance
I1, I2, I3 ) ( input alphabet
( )applied .
.2( O1, O2, O3,. :)Output .
.3( :)States
..q1, q2, q3

.4 ( : )State relation
.
.5 ( ):Output relation
. .
(State
).relation

(.)Memory
.
. )Moore Machine(
.)Mealy Mach(

( finite state
.)automaton

24=16

( )0000,0001,0010,.. . input alphabet

. 4-bit :

. Mealy
).)Mach
( )sequential .

()analytically ()tuple
:

.i

.ii

(. )alphabet input

.iii

( direct transition

.)function (.)transition
.
.iv

.v

. .

) ( .)indirect transition function

()difference

( ) (. )arguments
(.)next state function
3

( )transition system or transition graph ()labeled

, )directed( ( )vertex or node ( )edges
. input/output:
)typical( .
() ( )concentric
. () input/output

1 ,

(. )e.g. 1/0 or 1/1

1 .

: (: )tuple
.a

,:

, ,

.
.b
.c

:
)vertex

( node or

.( )determine
()initial state ( )final state
.101011,111010

(

) . 101011

. ()path value

101011

111010 . .111010

(. )accepting state

(.)transition table }
=} Q

{ }

110101:

( ).

.
}

{ 0 .

( )uniquely .
.)nondeterministic automaton( .

) nondeterministic finite state(NDFA

(:)tuples
:
.i
.ii
.iii

.
.

2 Q

. Q
.iv

.v

) deterministic automaton (DFA : . Q

) nondeterministic automaton(NDFA (.Q )subset
:

0100 :

()accepting state 0100

.
:

NDFAM

M )

( .

M M

M deterministic nondeterministic
. M ) (denoted

.DFA & NDFA (intuitively) :

.i

DFA NDFA (.

}

.ii

(.

NDFA )(more general ). (powerful

NDFA DFA . NDFA L

NDFA DFA . L

} {

{}

.i
.ii
.iii
.iv

{ :

( .)initial state
&

( )table state :

10

&

&

( )corresponding . 0

.
M n

( )reachable

. ( constructing )
.

( )continue ) (consider

. ( )halt

(.)input column

} {

11

{}

( )equivalent M :

.
.

. .
)reachable( .
()restriction other (
.)alphabet ()value of output function
()present state

()present input

(.)output function ( )generalized model

.Mealy
( )independent
:

12

) (restricted model . Moore )(convenient

Moore Model ( )automaton theory
.
:

. :

Moore Machine
.i
.ii
.iii

.
.
(.)output alphabet

.iv

.v

.vi

Mealy Machine
.Moore Machine

.
.

. Moore Machine ()initial state

.

& .

13

0111
.00001
:

( Mealy Machine 0011

. .0100 Mealy

Machine .

. Moore Machine
.

FA Moore Machine }
( ) defining

Moore Machine n
. Mealy Machine

14

Mealy Machine Moore Machine ( vice

. )versa (
.)

Mealy Machine ( )described .

Moore Machine ( )equivalent . Mealy Machine

( )stage - -
.

. : ()problem

. 1 0

0,1 0 ( .)respectively
15

. ) similarly (

( )pair :

( )revised. Moore Machine ( )observe

. 1 1

. Moore Machine ( zero-length

)sequence .Mealy Machine

16

overcome ( ) Moore
Machine
( )identical

( )starting state

.0 ( ( revised

)foregoing(

Mealy

.Machine
m Moore Machine

)acceptability( Moore Machine

. Moore Machine M Mealy Machine M

()relation

()satisfied

Moore Machine

.
. Moore Machine Mealy Machine

17

.a
.

Mealy Machine

.b . Moore Machine

Mealy Machine Moore Machine :

Mealy Machine . Moore Machine

Moore Machine
( )next state column . Mealy Machine:

1 0 (. )respectively

Mealy Machine :

18

:
( )model
(.)identical
( )identical transition rows
corresponding , .

Moore Machine . Mealy Machine

.

( )identical :

19

( )construct

. ( )lies( )interest

. ( )relation

( )strings

( )non final state

. ( )equivalent 0

.0

20

.a .
.b

: . )0-equuivalence( 0
}

) ,
.

( the same equivalence

)calss

. ,

. ,
.

.
.

: :
(: )minimum
.

21

: :
22

} { ). (portioned } {

. ( entries ) 0

. ( entries ) 1
.

. 0

. 1

. }

( )construction

{ }

. }

.
.

. 0 1

. }

} { . 0
. 1
.

23

{ }

{ .{ }

.
:

, :

( )transition diagram :

24

( )alphabet ( ) atomic .
. :
}

{
{

}
}
}

.
{

.
{

. :
}

( )elements (. )symbols ,
. ( )length of string

25

| | .

|.

| |

( : ) empty string 0 ()denoted

| . | (.)whatsoever

( ) ()express

. :

{ }
}

........

()denoted *

Kleeny closure :

( )exclude

. ( )denoted +positive

. closure

26

} {
:
} {

( infinite many

. )strings ( )new languages

( )set operation ( )union
( )intersection ( )difference ( .)complement :

:
( )universal set

( )not in the set

.
( concatenation ) .

. :

()symbol

.
)commutative(

( )associative

( )restriction ()order

27

(. )languages:

null null . null

( )empty

}{
:

( )languages
( )constraint .
} {

}
} {

:
: )arbitrary(
0 1

28

( )DFA }

29

011:

(.)initial state

.1 . )acceptable(
.

.2 0 ( )pattern 001
. } . {011,0011,00011,
. 0

( ) vertex

.3 ( ) pattern011
} {1011,11011,111011,..

.4 3 2 DFA :

30

.5 01 011

( )arc

0 ( )reach __( )accepted state

011

.6 011 / .

01

. .Deterministic.
:

31

a null 4
a } :

{.
:

.1 ( ) null

.2 4 a
.

32

(
)

33

.1

null :

.2

34

) (accepted state .

M :

35

36

} { .

. M :

.
( )

()

. ( )disjoint .

.
.

37

.1

.2

null

()

) (decompose
:

.:

( consuming
) :

38

101101 :

39

101101 :

:
.1

40

.2

41

(.)acceptable state
: 101101

)acceptable path( .

F
( ).

42

10101 .

F (.
F )
:

43

. ) (experience
.
) (consumption
.
) (purpose

()null string

( . )
()null string

. .
. )sepontaneous( .
(. )flexibility
.

( )extension .

( )

)sepontaneous( .

NDFA

44

(partial)

( )behavior moves

NDFA with

( )nature .

45

"

} {

"

. 2

46

:
.
moves

NDFA with

47

. 47
.

:
.
. :
:

.
:

48

. :

:
:
.

49

NDFA (
.

: 0

. NDFA

50

NDFA :

NDFA :

51

. :

( )extension .

.
. DFA .

52

.

:

)
. ...
.

53

(DFA ) :

. 32 1

. 2

.
.
: 0

.1 }

{ .:

.:

.2 ( 0
) .:

54

.3 .

55

.
.
}

{:

56

}
.

57

.
:

58

.10
:

.
.

59

60

61

.
.
:

62

63

( )power ( )accept
( ) (.)string
( )convenient way
.
( )algebraic expression .)regular expression(

)union

()concatenation . )Kleeny closure( Kleeny ( )generated

(. )Regular Language ( )capable
. ( )significance
( )Bold
. .
:
+ . ) 5 + 3 ( 4
( )regular operations
.

32 ( )
0 1 .
( )dissecting .
: 1 0 ( )shorthand } {
} {

} { . }

} {

{ . * 0

} { .

64

: ( ).( )concatenation

. ()attaches

.
.
( pattern ) .
( )powerful .
}

.A

( )basis :

( ) corresponding
. { }

. { }
.B . :

.C . :

)+( : union
( ). )*( concatenation . Kleeny
.D

. "

" . "addition property of regular expression".

.E

" . "concatenation property of regular expression". "

65

.F

. " Kleeny " . "

. "closure property of regular expression

. :

{ }

.G .
:
+ ( )addition or union
. ( )concatenation
* ) Kleeny closure ( Kleeny
66

( )

:
( )addition :

{.

1 1
. * .
:
{

10 .
.

67

1
.

001 .

(
0 ) .

{
.
. 3

( ) . ( )

precedence enumerate .
.i

{ . } {

68

{.

{ }

.ii

} :

.iii

{ .
.

.iv

:
:

:
.v

. :

:
11 }: (..... 0011 , 011 ,
( ...... ,1100 ,110 , )

69

). { ......... ,001100 ,00110 ,01100 ,0110 ,

.

.vi

. 101
101
.

.x

..
.
:
DFA NDFA
.
( ) .
.
:
)1

DFA/NDFA/NDFA

.
)2 .regular expression
.
( )method ( )construction
.

70

NDFA with moves :

71

:
:

72