Comp1- Finite state machines Flashcards

1
Q

Whats a finite state machine?

A

a machine that consists of a fixed set of possible states with a set of allowable inputs that change state and a set of possible outputs.

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

Whats the symbol for a state?

A

a circle

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

whats the sybol for an accepting state?

A

a circle with a smaller circle inside.

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

Whats the symbol for initial state?

A

an arrow pointing to it.

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

What is a state transition diagram

A

a way of describing a FSM graphically. shows what inputs cause a state change in each state.

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

What is a finite state machine with no outputs called?

A

a finite state automaton (FSA)

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

why are FSM so useful?

A

they can recognize sequences.

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

what are finite state machines with outputs called.

A

mealy machine

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

whats a mealey machine?

A

a FSM with outputs, and usually no accepting states

written A, response

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

what is a state transition table?

A

shows the effect on the current state of a FSM of particular inputs and any corresponding output.

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

What is a decision table?

A

a table that shows the outcome for a given logical condition.

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