About this document

Understanding Finite State Automata by rajad is a document available to read on EtoBox.

Finite state automata (FSA) are a type of finite state machine where the output and next state depend only on the current input and state. An FSA is defined as a 5-tuple (I, S, f, A, σ) where I is the input alphabet, S is a set of states, f defines the transition function, A is the set of accepting states, and σ is the initial state. A string is accepted by an FSA if there is a sequence of state transitions corresponding to the string

Author

rajad

Language

EN