Directory of Finite State Automata Resources
Home > Computers > Computer Science > Theoretical > Automata Theory > Finite State Automata
Finite state automata (FSA) are devices that can be in one of a finite number of states, one of which is called the start state and one or more are called final states. Transitions are defined for each state when the FSA reads a symbol from an input language. If a word, or input string of symbols from the input language, is provided to the FSA and if it starts at a start state and arrives at a final state after reading the word, we say the word is accepted by the FSA. Languages of words accepted by FSA are called regular languages.
Resources in This Category
-
Finite State Automata
http://www.eti.pg.gda.pl/katedry/kiw/pracownicy/Jan.Daciuk/personal/thesis/node12.html
An introduction to deterministic and nondeterministic FSA, with simple examples. -
Nondeterministic Finite State Machines
http://en.wikipedia.org/wiki/Nondeterministic_finite_automaton
A Wikipedia article on nondeterministic FSA.
Related Categories
Home > Computers > Computer Science > Theoretical > Automata Theory > Finite State Automata
Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us
