SD02 - Finite State Machines 1 Flashcards

1
Q

What is a formal system?

A

A mathematical or mechanical description that defines a machine and how it works. Assertions about the operations and properties of these machines can be mathematically proven to be correct

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are three ways of representing a finite-state machine?

A

Graphically
As a transition table
As a collection of sets and functions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Can a finite-state machine have an infinite input or output?

A

Yes. The ‘finite’ in finite-state machine only refers to the number of states it has

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are the four columns of a state transition table?

A

Current state, input symbol, output symbol, next state

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

For a machine with n states and i input symbols, how many rows will the state transition table have?

A

n*i

How well did you know this?
1
Not at all
2
3
4
5
Perfectly