 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
| WildBot has found potential problems with this book. Please check the talk page for a detailed explanation of what these might be and how to fix them. When these are resolved, you can remove |wildbot=yes from this template. |
Finite State Machine Basis
editFSM
edit- Automata theory
- Automata-based programming
- Binary tree
- Currying
- De Bruijn graph
- De Bruijn sequence
- Decision table
- Deterministic finite-state machine
- Directed acyclic graph
- Event-driven finite state machine
- Extended finite state machine
- Finite state machine
- FSMD
- Iterative deepening depth-first search
- Linear bounded automaton
- Linear feedback shift register
- Monoid
- Nicolaas Govert de Bruijn
- Nondeterministic finite state machine
- Pinwheel (cryptography)
- Pseudorandom binary sequence
- Pseudorandom number sequence
- Pushdown automaton
- Quantum finite automata
- Queue machine
- Read only right moving Turing Machines
- Semiautomaton
- State (computer science)
- State diagram
- State transition table
- Stochastic matrix
- Taylor Booth
- Transition function
- Tree (graph theory)
- Turing machine
- Uncountable set
- Virtual finite state machine