Abstract Automata

The Mathematical Concept of System Finite State Automaton

Abstract Automata
Daniel D. Warner
Department of Mathematical Sciences Clemson University

August 25, 2013

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

The Mathematical Concept of a System

There are only a few really broad ideas in applied mathematics. Familiar concepts are Functions, Groups, Fields, etc. But central to dynamic behavior is the idea of a System.

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

The Mathematical Concept of a System

There are only a few really broad ideas in applied mathematics. Familiar concepts are Functions, Groups, Fields, etc. But central to dynamic behavior is the idea of a System. A System is a mathematical concept that can be described as a black box with an Input, an Output, and an Internal State. The internal state changes as a function of the current state and the input

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

The Mathematical Concept of a System

There are only a few really broad ideas in applied mathematics. Familiar concepts are Functions, Groups, Fields, etc. But central to dynamic behavior is the idea of a System. A System is a mathematical concept that can be described as a black box with an Input, an Output, and an Internal State. The internal state changes as a function of the current state and the input Often the Input, Output, and States are functions and the state transitions are specied through differential operators. A drone airplane is an excellent example.

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

The Mathematical Concept of a System

There are only a few really broad ideas in applied mathematics. Familiar concepts are Functions, Groups, Fields, etc. But central to dynamic behavior is the idea of a System. A System is a mathematical concept that can be described as a black box with an Input, an Output, and an Internal State. The internal state changes as a function of the current state and the input Often the Input, Output, and States are functions and the state transitions are specied through differential operators. A drone airplane is an excellent example. Systems can also include stochastic behavior. Markov processes are systems, for example.

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

The Mathematical Concept of a System

There are only a few really broad ideas in applied mathematics. Familiar concepts are Functions, Groups, Fields, etc. But central to dynamic behavior is the idea of a System. A System is a mathematical concept that can be described as a black box with an Input, an Output, and an Internal State. The internal state changes as a function of the current state and the input Often the Input, Output, and States are functions and the state transitions are specied through differential operators. A drone airplane is an excellent example. Systems can also include stochastic behavior. Markov processes are systems, for example. If the Input, Output, and States are nite sets we have an FSA.
Daniel D. Warner Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

Finite State Automaton

A Finite State Automaton is a 6-tuple, (I , O, S, s0 , f , g) where
1 2 3 4 5 6

I is a nite set called the input alphabet, O is a nite set called the output alphabet, S is a nite set called the set of states. s0 is a distinguished state called the start state, f : S I S is the state transition function, and g : S I O is the output function.

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

Finite State Automaton

A Finite State Automaton is a 6-tuple, (I , O, S, s0 , f , g) where
1 2 3 4 5 6

I is a nite set called the input alphabet, O is a nite set called the output alphabet, S is a nite set called the set of states. s0 is a distinguished state called the start state, f : S I S is the state transition function, and g : S I O is the output function. The FSA as dened here is often called a transducer.

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

Finite State Automaton

A Finite State Automaton is a 6-tuple, (I , O, S, s0 , f , g) where
1 2 3 4 5 6

I is a nite set called the input alphabet, O is a nite set called the output alphabet, S is a nite set called the set of states. s0 is a distinguished state called the start state, f : S I S is the state transition function, and g : S I O is the output function. The FSA as dened here is often called a transducer. With g as dened, this FSA is a Mealy machine.

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

Finite State Automaton

A Finite State Automaton is a 6-tuple, (I , O, S, s0 , f , g) where
1 2 3 4 5 6

I is a nite set called the input alphabet, O is a nite set called the output alphabet, S is a nite set called the set of states. s0 is a distinguished state called the start state, f : S I S is the state transition function, and g : S I O is the output function. The FSA as dened here is often called a transducer. With g as dened, this FSA is a Mealy machine. If the domain of g is simply S, that is, it only depends on the new state, then the FSA is a Moore machine.

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

Vending Machine Example

Vending machines are excellent examples of FSA.

Consider a machine that accepts nickels, dimes, and quarters and sells you a pack of gum for 25 cents The input alphabet can be the set {nickel, dime, quarter} The states of the machine correspond to the amount of money that has been entered {S0 , S5 , S10 , S15 , S20 ,}. The output alphabet would be {gum, gum + 5 cents, gum + 10 cents, gum + 15 cents, gum + 20 cents}

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

Mealy FSA

Table : State Transition Function

state S0 S5 S10 S15 S20

nickel S5 S10 S15 S20 S0

dime S10 S15 S20 S0 S0

quarter S0 S0 S0 S0 S0

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

Mealy FSA

Table : Output Function

state S0 S5 S10 S15 S20

nickel null null null null gum

dime null nulll null gum gum + 5 cents

quarter gum gum + 5 cents gum + 10 cents gum + 15 cents gum + 20 cents

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

State Transition Diagram

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

Moore FSA

Table : State Transition Function

state S0 S5 S10 S15 S20 S25 S30 S35 S40 S45

nickel S5 S10 S15 S20 S25 S5 S5 S5 S5 S5

dime S10 S15 S20 S25 S30 S10 S10 S10 S10 S10

quarter S25 S30 S35 S40 S45 S25 S25 S25 S25 S25

Daniel D. Warner

Abstract Automata

Abstract Automata

The Mathematical Concept of System Finite State Automaton

Moore FSA

Table : Output Function

state S0 S5 S10 S15 S20 S25 S30 S35 S40 S45

output null null null null null gum gum + 5 cents gum + 10 cents gum + 15 cents gum + 20 cents

Daniel D. Warner

Abstract Automata