finite automaton (AF) or finite state machine

##### Title

##### Question

HELLO, sorry for the inconvenience, I have a question, how can I define the relationship between the alphabet and the states of a finite automaton (AF) or finite state machine so that the state transition can load it by triplet?

Scilab General

__Answers:__

This question is not related to Scilab. For more information on this topic, kindly refer the wikipedia.

Login to add comment