Finite State Machines - Revision history

Michael Murtaugh at 07:52, 1 February 2021

2021-02-01T07:52:06Z

← Older revision		Revision as of 09:52, 1 February 2021
Line 4:		Line 4:

	https://miro.medium.com/max/1620/1*NXKxy9U-kYxiYk786dsOvA.jpeg		https://miro.medium.com/max/1620/1*NXKxy9U-kYxiYk786dsOvA.jpeg
			https://medium.com/re-form/the-timelessness-of-snakes-and-ladders-4ae7d205a4e7

	In this case, each space on the board represents a "state" of the machine. The current state is indicated by the position of the player's token. The "input" to the state is the result of the roll of a die (1 - 6). Slides and ladders are additional transitions between the states (based on no input, or you could say the "input" of a player landing on that square). Thus with this relatively simple structure, the limited inputs (the six sides of the die) produce a variety of results in the game as it depends each time on the current "state" of the game (where the player is at the time the roll of the die occurs).		In this case, each space on the board represents a "state" of the machine. The current state is indicated by the position of the player's token. The "input" to the state is the result of the roll of a die (1 - 6). Slides and ladders are additional transitions between the states (based on no input, or you could say the "input" of a player landing on that square). Thus with this relatively simple structure, the limited inputs (the six sides of the die) produce a variety of results in the game as it depends each time on the current "state" of the game (where the player is at the time the roll of the die occurs).

Michael Murtaugh at 07:49, 1 February 2021

2021-02-01T07:49:43Z

← Older revision		Revision as of 09:49, 1 February 2021
Line 9:		Line 9:
	In her 1995 MIT [[PhD]] thesis, Sommer Elizabeth Gentry wrote about [http://dspace.mit.edu/handle/1721.1/33207 dancing as a finite state machine].		In her 1995 MIT [[PhD]] thesis, Sommer Elizabeth Gentry wrote about [http://dspace.mit.edu/handle/1721.1/33207 dancing as a finite state machine].

	[[File:danceasfsm-gentry.png]]		[[File:danceasfsm-gentry.png\|frame]]

	Another example of a FSM, and one featured in Hillis's Pattern on the Stone, is a traffic light or a combination lock.		Another example of a FSM, and one featured in Hillis's Pattern on the Stone, is a traffic light or a combination lock.

Michael Murtaugh at 07:49, 1 February 2021

2021-02-01T07:49:09Z

← Older revision		Revision as of 09:49, 1 February 2021
Line 9:		Line 9:
	In her 1995 MIT [[PhD]] thesis, Sommer Elizabeth Gentry wrote about [http://dspace.mit.edu/handle/1721.1/33207 dancing as a finite state machine].		In her 1995 MIT [[PhD]] thesis, Sommer Elizabeth Gentry wrote about [http://dspace.mit.edu/handle/1721.1/33207 dancing as a finite state machine].

	~~attachment~~:~~danceasfsmfig~~.~~gif~~		[[File:danceasfsm-gentry.png]]

	Another example of a FSM, and one featured in Hillis's Pattern on the Stone, is a traffic light or a combination lock.		Another example of a FSM, and one featured in Hillis's Pattern on the Stone, is a traffic light or a combination lock.

Michael Murtaugh at 07:46, 1 February 2021

2021-02-01T07:46:34Z

← Older revision		Revision as of 09:46, 1 February 2021
Line 7:		Line 7:
	In this case, each space on the board represents a "state" of the machine. The current state is indicated by the position of the player's token. The "input" to the state is the result of the roll of a die (1 - 6). Slides and ladders are additional transitions between the states (based on no input, or you could say the "input" of a player landing on that square). Thus with this relatively simple structure, the limited inputs (the six sides of the die) produce a variety of results in the game as it depends each time on the current "state" of the game (where the player is at the time the roll of the die occurs).		In this case, each space on the board represents a "state" of the machine. The current state is indicated by the position of the player's token. The "input" to the state is the result of the roll of a die (1 - 6). Slides and ladders are additional transitions between the states (based on no input, or you could say the "input" of a player landing on that square). Thus with this relatively simple structure, the limited inputs (the six sides of the die) produce a variety of results in the game as it depends each time on the current "state" of the game (where the player is at the time the roll of the die occurs).

	In her 1995 MIT [[PhD]] thesis, Sommer Elizabeth Gentry wrote about [http://dspace~~-demo~~.mit.edu/handle/1721.1/33207 dancing as a finite state machine].		In her 1995 MIT [[PhD]] thesis, Sommer Elizabeth Gentry wrote about [http://dspace.mit.edu/handle/1721.1/33207 dancing as a finite state machine].

	attachment:danceasfsmfig.gif		attachment:danceasfsmfig.gif

Michael Murtaugh at 07:45, 1 February 2021

2021-02-01T07:45:42Z

← Older revision		Revision as of 09:45, 1 February 2021
Line 3:		Line 3:
	Finite state machines can be thought of as a kind of "Snakes & Ladders game". In this children's board game, a player tries to climb the spaces of a playing board to be the first to reach the top. The player marks his or her position on the board with a token. The player rolls a die and moves his or her token that many spaces on the board. Some squares are linked with ladders, and others with snakes. If a player happens to end up on such a marked square, he or she has the advantage, or misfortune, to have to move their token either up to a later or down to an earlier square on the board.		Finite state machines can be thought of as a kind of "Snakes & Ladders game". In this children's board game, a player tries to climb the spaces of a playing board to be the first to reach the top. The player marks his or her position on the board with a token. The player rolls a die and moves his or her token that many spaces on the board. Some squares are linked with ladders, and others with snakes. If a player happens to end up on such a marked square, he or she has the advantage, or misfortune, to have to move their token either up to a later or down to an earlier square on the board.

	~~attachment~~:~~snakesandladders_detailandfull~~.~~jpg~~		https://miro.medium.com/max/1620/1*NXKxy9U-kYxiYk786dsOvA.jpeg

	In this case, each space on the board represents a "state" of the machine. The current state is indicated by the position of the player's token. The "input" to the state is the result of the roll of a die (1 - 6). Slides and ladders are additional transitions between the states (based on no input, or you could say the "input" of a player landing on that square). Thus with this relatively simple structure, the limited inputs (the six sides of the die) produce a variety of results in the game as it depends each time on the current "state" of the game (where the player is at the time the roll of the die occurs).		In this case, each space on the board represents a "state" of the machine. The current state is indicated by the position of the player's token. The "input" to the state is the result of the roll of a die (1 - 6). Slides and ladders are additional transitions between the states (based on no input, or you could say the "input" of a player landing on that square). Thus with this relatively simple structure, the limited inputs (the six sides of the die) produce a variety of results in the game as it depends each time on the current "state" of the game (where the player is at the time the roll of the die occurs).

Michael Murtaugh at 11:02, 1 October 2008

2008-10-01T11:02:43Z

← Older revision		Revision as of 13:02, 1 October 2008
Line 17:		Line 17:
	Next:		Next:

	* [:[[FiniteStateMachines~~]]:~~example of a Finite State Machine in PD]		* [[FiniteStateMachines \| example of a Finite State Machine in PD]]

	=== Resources ===		=== Resources ===

	* http://en.wikipedia.org/wiki/Finite_state_machine		* http://en.wikipedia.org/wiki/Finite_state_machine

Michael Murtaugh at 11:01, 1 October 2008

2008-10-01T11:01:38Z

New page

Finite state machines add the idea of time to basic logic. Instead of having single "black box" with a single set of inputs and outputs, a finite state machine is like having many boxes, each for a different situation, and where one box is "active" at a time. Then, we use the logic of each box or "state" to determine not only outputs (say, lights or sounds), but also what the "next state" of the machine is. In this way, you can visualize a finite state machine as a kind of graph with nodes that represent the states and transitions between the nodes labelled by the situations that determine when the transitions should occur. In addition to the physical / logical configuration of the states, these signals or transitions would be determined by the inputs coming into that state.

Finite state machines can be thought of as a kind of "Snakes & Ladders game". In this children's board game, a player tries to climb the spaces of a playing board to be the first to reach the top. The player marks his or her position on the board with a token. The player rolls a die and moves his or her token that many spaces on the board. Some squares are linked with ladders, and others with snakes. If a player happens to end up on such a marked square, he or she has the advantage, or misfortune, to have to move their token either up to a later or down to an earlier square on the board.

attachment:snakesandladders_detailandfull.jpg

In this case, each space on the board represents a "state" of the machine. The current state is indicated by the position of the player's token. The "input" to the state is the result of the roll of a die (1 - 6). Slides and ladders are additional transitions between the states (based on no input, or you could say the "input" of a player landing on that square). Thus with this relatively simple structure, the limited inputs (the six sides of the die) produce a variety of results in the game as it depends each time on the current "state" of the game (where the player is at the time the roll of the die occurs).

In her 1995 MIT [[PhD]] thesis, Sommer Elizabeth Gentry wrote about [http://dspace-demo.mit.edu/handle/1721.1/33207 dancing as a finite state machine].

attachment:danceasfsmfig.gif

Another example of a FSM, and one featured in Hillis's Pattern on the Stone, is a traffic light or a combination lock.

Another example might be a telephone system / answering machine.

Next:

* [:[[FiniteStateMachines]]:example of a Finite State Machine in PD]

=== Resources ===

* http://en.wikipedia.org/wiki/Finite_state_machine