Learning Automata

Similar topics in Freebase

• 

  Pushdown automaton

  In automata theory, a pushdown automaton (PDA) is a finite automaton that can make use of a stack containing data. Pushdown automata differ from finite state machines in two ways: Pushdown automata choose a transition by indexing a table by input signal, current state, and the symbol at the top of...
• 

  Turing machine

  A Turing machine is a theoretical device that manipulates symbols contained on a strip of tape. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside of a computer. The "Turing"...
• 

  Deterministic finite state machine

  In the theory of computation, a deterministic finite state machine (also known as deterministic finite state automaton (DFSA) or deterministic finite automaton (DFA) ) is a finite state machine where for each pair of state and input symbol there is one and only one transition to a next state. DFAs...
• 

  Nondeterministic finite state machine

  In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes it from the deterministic finite automaton (DFA),...
• 

  Lattice gas automaton

  Lattice gas automata (LGA) or lattice gas cellular automata (LGCA) methods are a series of cellular automata methods used to simulate fluid flows. It was the precursor to the lattice Boltzmann methods. From the LGCA, it is possible to derive the macroscopic Navier-Stokes equations. Interest in the...