Site Navigation
Categories:
Automata
Computational models
Digital electronics
Formal methods
Cleanup from March 2008
All pages needing cleanup

Summary Of: Finite state machine

A finite state machine is an abstract model of a machine with a primitive internal memory... The example in figure 2 shows a finite state machine which accepts the word... A finite state machine that determines if a binary number has an odd or even number of 0s... A finite state machine that determines if a binary number has an odd or even number of 0s... A finite state machine that determines if a binary number has an odd or even number of 0s...

Encyclodia Page On: Finite state machine

These Are Links To Other Documents
State transition system | | cleanup | quality standards | Fig.1 Example of a Finite State Machine | | states | state diagram | state transition table | state tables | VFSM | electrical engineering | linguistics | computer science | philosophy | biology | mathematics | logic | automata theory | theory of computation | Fig. 2 Acceptor FSM: parsing the word "nice" | | regular languages | Fig. 3: A finite state machine that determines if a binary number has an odd or even number of 0s. | | deterministic finite automaton | binary | Transducers | computational linguistics | Moore machine | Fig. 4 Transducer FSM: Mealy model example | | Mealy machine | virtual FSM | event driven FSM | DFA | NDFA | GNFA | Fig. 5 FSM Logic (Mealy) | | quintuple | alphabet | Nondeterministic finite state machine | finite state transducer | alphabet | Nondeterministic finite state machine | Mealy machine | Moore machine | semiautomaton | transition system | Implication table | Moore reduction procedure | Fig. 6 The circuit diagram for a 4 bit TTL counter, a type of state machine | | circuit diagram | TTL | digital circuit | programmable logic device | programmable logic controller | logic gates | flip flops | relays | register | Richard's Controller | event driven FSM | virtual FSM (VFSM) | Automata-Based Programming | Abstract state machine | Decision tables | Extended finite state machine | Finite state machine with datapath | Petri net | Pushdown automaton | Quantum finite automata | Sequential logic | Statechart | Transition system | Turing machine | Hidden Markov model | Ant Wars | Game AI | SCXML | ISBN 0-8493-8086-3 | ISBN 1-57820-110-1 | ISBN 0-75068-706-1 | ISBN 0-7923-8609-4 | ISBN 0-7923-9842-4 | ISBN 0-7923-9892-0 | ISBN 0-521-20402-X | ISBN 0-8053-0143-7 | Church-Turing thesis | ISBN 0-201-02988-X | ISBN 0-444-00249-9 | ISBN 0-387-94907-0 | ISBN 0-13-262478-8 | Christos Papadimitriou | ISBN 0-201-53082-1 | ISBN 0-07-042807-7 | ISBN 0-471-08840-4 | Markov chain | subshifts of finite type | v | d | Automata theory | formal languages | formal grammars | Chomsky
hierarchy
| Grammars | Languages | Unrestricted | Context-sensitive | Indexed | Tree-adjoining | Context-free | Deterministic context-free | Regular | Recursively enumerable | Recursive | Context-sensitive | Indexed | Mildly context-sensitive | Context-free | Deterministic context-free | Regular | Star-free | Turing machine | Decider | Linear-bounded | Nested stack | Embedded pushdown | Nondeterministic pushdown | Deterministic pushdown | Finite | Aperiodic finite | proper subset | Categories | Automata | Computational models | Digital electronics | Formal methods | Cleanup from March 2008 | All pages needing cleanup |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Finite state machine".