finite-state

Neural networks, for example, are capable of learning, and there is a body of literature which demonstrates that recurrent neural networks can be trained to behave like deterministic finite-state automata (DFA).

Archive 2009-05-01 Gordon McCabe 2009

The main running example was my Citizen Quartz Multi-Alarm digital wristwatch, which was claimed in the rejection material by some to be too simple an example for illustrating the concepts and by others to be far too detailed for a scientific article… Some claimed that since the paper was about the much studied finite-state machine formalism it could not contain anything new or interesting…

Archive 2007-06-01 Jim Horning 2007

The main running example was my Citizen Quartz Multi-Alarm digital wristwatch, which was claimed in the rejection material by some to be too simple an example for illustrating the concepts and by others to be far too detailed for a scientific article… Some claimed that since the paper was about the much studied finite-state machine formalism it could not contain anything new or interesting…

Illegitimis non carborundum. Jim Horning 2007

Actually, the bomb hasn't even been dropped yet, and von Neumann is putting together all the theory to actually build this thing, which also goes back to Turing, who, before that, gave the idea that you could do all this with a very brainless, little finite-state machine, just reading a tape in and reading a tape out.

George Dyson at the birth of the computer 2003

Actually, the bomb hasn't even been dropped yet, and von Neumann is putting together all the theory to actually build this thing, which also goes back to Turing, who, before that, gave the idea that you could do all this with a very brainless, little finite-state machine, just reading a tape in and reading a tape out.

George Dyson at the birth of the computer 2003

Actually, the bomb hasn't even been dropped yet, and von Neumann is putting together all the theory to actually build this thing, which also goes back to Turing, who, before that, gave the idea that you could do all this with a very brainless, little finite-state machine, just reading a tape in and reading a tape out.

George Dyson at the birth of the computer 2003

The new Synplify tool release enables engineers to build higher reliability into their FPGA designs through a new feature that provides automated creation and preservation of error-correction logic, including safe finite-state machines FSMs.

unknown title 2011

Deterministic finite-state automatons (DFA) allow efficient regular expression matching, where the regular expressions for several species can be combined to greatly increase efficiency.

BioMed Central - Latest articles 2010

LINNAEUS uses a dictionary-based approach (implemented as an efficient deterministic finite-state automaton) to identify species names and a set of heuristics to resolve ambiguous mentions.

BioMed Central - Latest articles 2010

You can use a simple FSM (finite-state machine) that uses three or four states with appropriate Gray coding to track the status of each main variable and its mirrored value in the storage devices.

Engineering Hardware-Software 2010