Thursday, January 06, 2005

Finite State Automata Reloaded

These people call themselves "FSA Labs"! Hmmm... Finite State Automata is a curious name for a software company :p

Finite state automata (FSA) is a behavioral model of a computer that has a finite amount of memory and whose memory possesses no further structure. It basically has a finite number of states, a set input symbols, a set of output symbols, and transitions from a state to another on encountering a particular input symbol defined. A state is designated as initial state, and a set of states may be designated as terminal sates. FSAs find practical applications in regular expressions and digital logic circuits.

Time to revise some Theory of Computation fundas!?

No comments: