autómata
51cellular automata (CA) — Simplest model of a spatially distributed process that can be used to simulate various real world processes. Cellular automata were invented in the 1940s by John von Neumann and Stanislaw Ulam at Los Alamos National Laboratory. They consist of a… …
52Gramática (autómata) — Una gramática G desde el punto de vista de un autómata, es un conjunto finito de reglas que describen toda la secuencia de símbolos pertenecientes a un lenguaje específico L. Una gramática es una estructura algebráica formada por 4 elementos… …
53Cellular Automata — [engl.], zellulärer Automat …
54Lattice gas automata — Gaz sur réseau Un gaz sur réseau est un type d automate cellulaire destiné à simuler le comportement d un fluide. Description Les gaz sur réseau sont des méthodes permettant de déterminer des solutions numériques aux équations de Navier Stokes… …
55LNCS192 — Automata on Infinite Words. Proceedings, Springer Verlag 1984. Edited by M. Nivat and D. Perrin. V, 216 pages, 1985 …
56LNCS194 — Automata, Languages and Programming. Proceedings, Springer Verlag 1985. Edited by W. Brauer. IX, 520 pages, 1985 …
57LNCS192 — Automata on Infinite Words. Proceedings, Springer Verlag 1984. Edited by M. Nivat and D. Perrin. V, 216 pages, 1985 …
58LNCS194 — Automata, Languages and Programming. Proceedings, Springer Verlag 1985. Edited by W. Brauer. IX, 520 pages, 1985 …
59Switch-technology — is a technology for automata based programming support. It was proposed by Anatoly Shalyto in 1991. It involves software specification, design, implementation, debugging, documentation and maintenance. The term “automata based programming” is… …
60Cellular automaton — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states …
