Apedia

Finite State Machine Computational Model Consisting Number Transitions

A finite state machine is a model with a limited number of states and transitions between them, possibly with associated actions.

A finite state machine is a model with a limited number of states and transitions between them, possibly with associated actions.

Vorderseite finite state machine
Rückseite A computational model consisting of a finite number of states and transitions between those states, possibly with accompanying actions [IEEE 610].

Learn with these flashcards. Click next, previous, or up to navigate to more flashcards for this subject.

Next card: State test transition testing black box design technique

Previous card: Condition compound single joined means logical operator xor

Up to card list: ISTQB Glossary of Terms in Software testing