Automaton - PDFSEARCH.IO - Document Search Engine

Automaton
Results: 1066

#	Item
961	Symmetry: The Quarterly of the International Society for the Add to Reading List Source URL: symmetry-us.com Language: English - Date: 2012-07-09 15:04:35 Abstract algebra Cellular automaton Glide reflection Frieze group Pattern Geometry Symmetry Mathematical analysis
962	Quantum Cellular Automata Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2013-03-26 14:28:57 Quantum cellular automata Quantum mechanics Cellular automata Quantum information science Cellular automaton
963	The Structure of the Elementary Cellular Automata Rule Space Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2013-03-26 14:30:37 Cellular automaton Dynamical system Markov chain
964	Int. Journ. of Unconventional Computing, Vol. 2, pp. 1–49 Reprints available directly from the publisher Photocopying permitted by license only Add to Reading List Source URL: uncomp.uwe.ac.uk Language: English - Date: 2010-03-29 16:18:35 Aeronautics Flight Glider aircraft Glider Cellular automaton Gun Rule 110 Military glider Gliding flight Aviation Gliding Aerodynamics
965	Rule 110 objects and other collision-based constructions Genaro Ju´arez Mart´ınez1 , Harold V. McIntosh2 , Add to Reading List Source URL: uncomp.uwe.ac.uk Language: English - Date: 2010-03-29 16:25:24 Aerodynamics Aeronautics Glider aircraft Solitons Glider Rule 110 Military glider Cellular automaton Gliding flight Aviation Gliding Flight
966	F Finite State Automata A ﬁnite automaton (FA, also called a ﬁnite-state automaton or a ﬁnite-state machine) is a mathematical tool used to describe processes involving inputs and outputs. An FA can be in one of several states and can switch between states depending Add to Reading List Source URL: www.davidsalomon.name Language: English - Date: 2004-09-09 19:53:48 Theoretical computer science Mathematics Combinatorics on words Models of computation Finite-state machine Theory of computation Regular expression Alphabet Regular language Automata theory Formal languages Combinatorics
967	by Gian-Carlo Rota ne morning in 1946 in Los Add to Reading List Source URL: library.lanl.gov Language: English - Date: 2006-12-18 18:15:45 Manhattan Project Austrian nobility Hungarian nobility John von Neumann Stanislaw Ulam Edward Teller Teller–Ulam design Gian-Carlo Rota Cellular automaton Science Mathematics Academia
968	A MOBIUS AUTOMATON: AN APPLICATION OF ARTIFICIAL INTELLIGENCE TECHNIQUES by Add to Reading List Source URL: ijcai.org Language: English - Date: 2008-09-30 05:15:42 Four-square cipher Classical cipher Computer programming Linguistics Computing
969	Submission to SC’06 The Technology Lane on the Road to a Zettaflops Add to Reading List Source URL: www.cse.nd.edu Language: English - Date: 2007-01-07 16:23:32 Electronics Cellular automata Automata theory Quantum dot cellular automaton Computer memory Logic family Logic gate Dynamic random-access memory FLOPS Electronic engineering Digital electronics Electronic design
970	Finite Automata and Their Decision Proble’ms# Abstract: Finite automata are considered in this paper a s instruments for classifying finite tapes. Each onetape automaton defines a set of tapes, a two-tape automaton defines a set of pairs of tapes, et cetera. The structure of the defined sets is studied. Various generalizations of the notion of an automaton are introduced Add to Reading List Source URL: www.cse.chalmers.se Language: English - Date: 2009-06-09 10:35:52 Applied mathematics Equivalence relation Nondeterministic finite automaton Regular language FO Sheaf Semigroup Model theory Tree automaton Automata theory Theoretical computer science Mathematics

UPDATE