Finite State Machines

Question 1

Automata theory

Answer 1

Using logic to solve computational problems using abstract machines & automata

Question 2

What are automatons?

Answer 2

An abstract self-propelled computing device which follows a predetermined sequence of operation automatically

Question 3

3 features of an automated machine

Answer 3

Inputs, Outputs, States

Question 4

Examples of automated machine

Answer 4

Finite state machine, State transition diagrams, Turing machines

Question 5

Finite state machines

Answer 5

An abstract model that has finite number of states and can only be in one state at a time but changes based on input

Question 6

S

Answer 6

a finite set of states

Question 7

S0

Answer 7

the initial state (node)

Question 8

X (or Σ)

Answer 8

the finite input alphabet/set

Question 9

Y (or ω)

Answer 9

the finite output alphabet/set

Question 10

δ

Answer 10

the state transfer function (edges)

Question 11

Λ

Answer 11

the output function

Question 12

Input symbols

Answer 12

set I with k being the number of inputs

Question 13

Output symbols

Answer 13

set Z with m being the number of outputs

Question 14

States

Answer 14

set Q