
	Where results make sense

Topic: Automata

Related Topics

Automata theory

Automaton

Karakuri

Body art

Wars of the Roses

Italian language

Morocco

In the News (Mon 28 May 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Automaton article - Automaton robot clocks cuckoo cuckoo clock Leonardo Vinci 1495 Leonardo's - What-Means.com (Site not responding. Last check: 2007-10-20)
		In 1769, a chess-playing automaton called the Turk made the rounds of the courts of Europe, but in fact was a famous hoax, operated from inside by a hidden human operator.
		Automata of this sort were also created in Japan and are known as Karakuri.
		Contemporary automata are represented by the works of Cabaret Mechanical Theatre in the United Kingdom and Dug North in the United States.
	www.what-means.com /encyclopedia/Automata (336 words)

	Cellular automaton - Wikipedia, the free encyclopedia
		A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, and theoretical biology.
		Reversible cellular automata are often used to simulate physical phenomena as gas and fluid dynamics, since they obey the laws of thermodynamics.
		Although such automata do not strictly satisfy the definition of a cellular automaton given above, it can be shown that they can be emulated by a conventional CA with a sufficiently large neighborhood and number of states, and can therefore be considered a subset of conventional cellular automata.
	en.wikipedia.org /wiki/Cellular_automata (2942 words)

	Automata theory - Wikipedia, the free encyclopedia
		Automata theory is a field of computer science which studies finite state machines, by means of mathematical representations of them (automata, Turing machines).
		The family of languages accepted by the above-described automata is called the family of regular languages.
		An LBA is a limited Turing machine; instead of an infinite tape, the tape has an amount of space proportional to the size of the input string.
	en.wikipedia.org /wiki/Automata_theory (803 words)

	The Role of Automata in the History of Technology (Site not responding. Last check: 2007-10-20)
		The automata and waterworks of the Renaissance undoubtedly reached the highest peak of development in the gardens of the royal chateau of Saint-Germain-en-Laye, which had often served as the residerce of the kings of France.
		It is difficult and even hazardous to attempt to delineate a priority in the various types of biological automata motivated by the relatively new mechanical clockwork instead of the hydraulic or pneumatic motivation of the past.
		A study of the history of automata clearly reveals that several of the basic inventions produced for these attempts to imitate life by mechanical means led to significant developments culminating in modern automation and cybernetics.
	xroads.virginia.edu /~DRBR/b_edini.html (6810 words)

	Automata Galleria
		English calendar clock, with music and automata, made c.1740.
		Automata, A Historical and Technological Study by Alfred Chapuis and Edmond Droz, Translated by Alec Reid.
		Automata, the Golden Age: 1848-1914 by Christen Bailly.
	www.nyu.edu /pages/linguistics/courses/v610051/gelmanr/ling.html (116 words)

	Team Automata
		In [Ell97] team automata were introduced explicitly for the specification and verification of groupware systems and they were shown to be promising at both the conceptual and the architectural level of groupware systems.
		Vector team automata are team automata in which the (team) actions have been replaced by vectors of (component) actions, from which the participation of a component automaton in a synchronization can thus be seen immediately.
		To this aim, team automata are used to model an instance of a particular stream signature protocol, while a well-established theory for defining and verifying a variety of security properties is reformulated in terms of team automata.
	fmt.isti.cnr.it /~mtbeek/TA.html (5590 words)

	Preface to Cellular Automata (1984)
		Cellular automata in the fourth class identified by Wolfram are conjectured to be capable of "universal computation": with appropriate initial conditions, their behaviour may mimic the behaviour of any computer (and perhaps any physical system).
		Self-organization in cellular automata occurs by the preferential generation of special sets of states with time; these preferred sets of states are known as "attractors" for the evolution.
		The analogy on the one hand between cellular automata and physical systems, and on the other hand between cellular automata and digital computers suggests that cellular automata may provide a vehicle by which the methods and results of computation theory may be applied to physics, and vice versa.
	www.stephenwolfram.com /publications/articles/ca/84-preface/2/text.html (1712 words)

	Introduction to cellular automata 05
		According to Wolfram, cellular automata belonging to class IV generate structures that are strongly reminiscent of the game of life.
		The cellular automata that are at the limit between classes I and II on the one hand, and class III on the other hand, are the only ones to be capable to deal with information in a useful way, and therefore are the only "interesting" ones
		With the generalization of cellular automata behaviours, diversity of universal structures or the existence of life, tends to show that the laws of our Universe are precisely at the border between order and chaos.
	www.rennard.org /alife/english/acintrogb05.html (824 words)

	Automata
		Automata are abstract machines that are normally conceived of a idealised, but much simplified computers that are devised to perform particular varieties of problem-solving procedures.
		The procedures performed by the automata illustrated here are employed to determine whether or not given strings of words constitute sentences.
		The first of these is the Finite-State Automaton, which is the simplest of the automata, and the second is the Push-Down Automaton, which differs from the Finite-State machine only in that it is equipped with a memory device that functions as a push-down store or stack.
	web.uvic.ca /~ling48x/ling484/examples/automata.html (730 words)

	Automata and Mechanical toys (Site not responding. Last check: 2007-10-20)
		This site introduces you to the world of Automata and is packed with information to help you make your own working models from wood, card and metal.
		Designing and making automata is an exciting hobby, covering a range of skills and processes from Art, Engineering and Science, through to Craft Skills involving card, wood and metal.
		It is ideal for anyone interested in making their own automata, but haven't got much making experience.
	www.automata.co.uk (481 words)

	Introduction to cellular automata 01
		There is a wealth of literature about cellular automata, as well as many Internet resources (you'll find some of them in the links section).
		For example, Fredkin's automata, that uses a Moore neighbourhood is based on the parity of neighbourhood.
		The first ones define the spatial structure of the automata network, that is its number of dimensions, the disposition of cells (squares, hexagons,… in a two dimensional automaton) and the type of neighbourhood determination.
	www.rennard.org /alife/english/acintrogb01.html (1611 words)

	Cellular Automata
		Cellular Automata models are capable of representing individual vehicle interactions and relating these interactions to macroscopic traffic flow metrics, such as throughput, time travel and vehicle speed.
		The all-important property of cellular automata, is that this function is defined discretely (a finite lookup table).
		Rule Evolution of the CA Evolutionary properties of the automata are properties that are affected by a rule.
	www.theory.org /complexity/traffic (3683 words)

	The British Clockmaker, Newfane, Vermont - Automata
		This page contains photographs of devices known as automata (or if you prefer, automatons.) Automaton (singular) is defined as: "A mechanism having its motive power so concealed that it appears to move spontaneously." The term is generally applied to mechanical human or animal figures which move by clockwork motivation.
		More automata information can be seen at the Delightful Machines web site where you will find information on further reading and other resource material.
		It is attributed to a collaboration by James Cox, the famous 18th century English clockmaker, and Joseph Merlin, an inventor and entrepeneur.
	thebritishclockmaker.com /automata (630 words)

	Alvy Ray Smith Cellular Automata Papers
		The class of pattern sets accepted by cellular automata (CA, finite, connected subsets of cells in a 2-dimensional cellular space) is shown to be precisely the class of languages generated by the monotonic array grammars, a generalization of context-sensitive grammars to the 2-dimensional integer grid.
		A collection of n finite, identical automata are considered, where each one, at each unit time step, takes a new state as a function of the state taken at the preceding step by itself and by certain other automata in the collection, called its neighbors, arbitrarily chosen, but limited in number.
		A formal study of pattern recognition capabilities of cellular automata (CA) is undertaken based on a class of recently introduced grammars for two dimensions, the array grammars, which can be thought of as the 2-dimensional generalization of context-sensitive grammars.
	alvyray.com /Papers/PapersCA.htm (1730 words)

	Historical Notes: History of cellular automata
		The best-known way in which cellular automata were introduced (and which eventually led to their name) was through work by John von Neumann in trying to develop an abstract model of self-reproduction in biology - a topic which had emerged from investigations in cybernetics.
		Starting in the early 1960s a few rather simple general features of cellular automata thought to be relevant to self-reproduction were noticed - and were studied with increasingly elaborate technical formalism.
		By the end of the 1950s it had been noted that cellular automata could be viewed as parallel computers, and particularly in the 1960s a sequence of increasingly detailed and technical theorems - often analogous to ones about Turing machines - were proved about their formal computational capabilities.
	www.wolframscience.com /reference/notes/876b (1653 words)

	Nature and origin of modern automata (from automata theory) -- Encyclopædia Britannica
		The components of automata consist of specific materials and devices, such as wires, transistors, levers, relays, gears, and so forth, and their operation is based on the mechanics and electronics of these parts.
		More results on "Nature and origin of modern automata (from automata theory)" when you join.
		Real or hypothetical automata of varying complexity have become indispensable tools for the investigation and implementation of systems that have structures amenable to...
	www.britannica.com /eb/article-21497?tocId=21497 (955 words)

	Amazon.ca: Books: Automata and Languages (Site not responding. Last check: 2007-10-20)
		This textbook presents an introduction to the theory of automata and to their connection with the study of languages.
		At the heart of the book is the notion that by considering a language as a set of words it is possible to construct automata which "recognize" words in the language.
		He demonstrates clearly and elegantly the fundamental connections between automata and abstract algebra via the concepts of syntactic monoid and minimal automaton.
	www.amazon.ca /exec/obidos/ASIN/0198534426 (209 words)

	automata - modern and antique magic, singing birds and carousel horses
		Michael and Maria have been restoring and selling automata and singing birds for ten years from premises in Central London and latterly the Portobello Road.
		With an average 8 to 12 week turnaround and excellent communication with the automaton's owner, the finished performance is guaranteed to give pleasure.
		We repaired the mechanism, and my delight as it sung its little heart out for the first time in years was as nothing compared to the owners when we delivered it back.
	www.automatomania.com (375 words)

	Algorithms on Finite Automata, parts I - IV -- from Mathematica Information Center
		In part III the mutual conversions between deterministic and non-deterministic automata are introduced.
		The last section deals with fractals derived from automata: to every word recognized by a given FA, we associate a quadtree specifying a fractal.
		The work is concisely commented and a bibliography is provided with the purpose of helping to adapt the functions in the four notebooks (which are introduced in an increasing order of dependency) with the theory taught in popular textbooks on the subject.
	library.wolfram.com /infocenter/MathSource/892 (294 words)

	BORFIG.com: Web Programming to the Extreme (Site not responding. Last check: 2007-10-20)
		BFC Automata is an MFC-based interpreter for 5 types of Automata: DFA, NFA, DSA, NSA and Turing Machine, including a simulation of un-stoppable ones.
		BFC Automata uses a very simple and easy-to-learn programming language to express Automata as readable text.
		BFC Automata v2.0 (Build 64) is released for free AS-IS with an installer.
	www.borfig.com /automata.aspx (135 words)

	Automata Definitions
		The automata gets the first symbol from the input, then goes from the starting state to the state designated by the transition function.
		The states are shown as circles, often unlabeled, the initial state has an arrow pointing to it, the final states have a double circle, the transition function is shown as directed arcs with the input symbol(s) on the arc.
		Nondeterministic Polynomial time Turing Machines, NP Change the deterministic delta transition table to a nondeterministic delta transition table and the TM represents a class of languages that are believed to be different from the language class P. NP is a set of languages, also called a class of languages.
	www.cs.umbc.edu /~squire/reference/automata_def.shtml (1871 words)

	Weak Alternating Automata Are Not That Weak (Site not responding. Last check: 2007-10-20)
		Automata on infinite words are used for specification and verification of nonterminating programs.
		Alternating automata have both existential and universal branching modes and are particularly suitable for specification of programs.
		Known translations of alternating automata to weak alternating automata involve determinization, and therefore involve a double-exponential blow-up.
	csdl2.computer.org /persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/istcs/1997/8037/00/8037toc.xml&DOI=10.1109/ISTCS.1997.595167 (234 words)

	Open Directory - Computers: Artificial Life: Cellular Automata (Site not responding. Last check: 2007-10-20)
		Cellular Automata and the Edge of Chaos - David J. Eck's Java-illustrated introduction to 1-dimensional cellular automata.
		Cellular Automata Laboratory - An extendable DOS/Windows application for exploring cellular automata, accompanied by a thorough user guide; by Rudy Rucker and John Walker.
		Dr.Cell Cellular Automata Simulator - A tool for simulating uniform or non-uniform cellular automata for a variety of neighborhood models, implemented in Scheme (a dialect of Lisp) using PLT's Dr.Scheme.
	dmoz.org /Computers/Artificial_Life/Cellular_Automata (1143 words)

	Main Page - Automata (Site not responding. Last check: 2007-10-20)
		Automata is a print magazine dedicated to covering the underground music scene - with emphasis on industrial, goth, synthpop, ambient, experimental and related genres - from a Christian perspective.
		After that is set, please view the getting started page to learn about formatting, naming conventions, etc. Then, once you have a handle on that, start adding your special knowledge to the database!
		Automata 8.0 features Franky Vivid, Bridgeshadows, Heart of Darkness, Lost in Place and much more...
	flamingfish.com /automata/index.php/Main_Page (273 words)

	Amazon.ca: Books: Cellular Automata: Theory and Experiment (Site not responding. Last check: 2007-10-20)
		Chapters cover mathematical analysis, the structure of the space of cellular automata, learning rules with specified properties: cellular automata in biology, physics, chemistry, and computation theory; and generalizations of cellular automata in neural nets, Boolean nets, and coupled map lattices.
		Current work on cellular automata may be viewed as revolving around two central and closely related problems: the forward problem and the inverse problem.
		The role of cellular automata in computation theory is seen as a particularly exciting venue for exploring parallel computers as theoretical and practical tools in mathematical physics.
	www.amazon.ca /exec/obidos/ASIN/0262570866 (521 words)

	Automata A Leader in Agriculture Monitoring,Irrigation Control,Satellite,Water Distribution,Control ...
		Automata manufactures complete system solutions including telemetry, software, and sensors used in a wide variety of industrial and agricultural applications.
		Automata will continue to be responsive to our valued customers and future products will continue to be based on the market needs.
		COMING SOON - A customer reference page, in the meantime if you would like a customer reference page sent to you please email me at marsha@automata-inc.com and I would be happy to email you one.
	www.automata-inc.com (303 words)

	Automata and Formal Languages (Site not responding. Last check: 2007-10-20)
		The latest applications of the automata and formal languages are in cryptography and computer graphics.
		Decidability questions on automata theory: The equivalence problem for multitape finite automata was shown to be decidable by T. Harju and J. Karhumäki in 1991.
		Following the approach used by S. Eilenberg in his monograph Automata, Languages and Machines and W. Kuich and A. Salomaa in Semirings, Automata and Languages he has studied the D0L and their generalizations in monoids and free algebras.
	www.math.utu.fi /research/automata/autores.html (1022 words)

	Craft Gallery Links: Automata
		CeraCera Moving Paper Automata - A Singapore based site with fascinating moving paper model and automata kits that can be downloaded and build.
		Automata - This is an educational site showing the history and mechanisums for making your own automata.
		You can also purchase "How to Design and make Automata" an educational book aimed at anyone intersted in making their own automata or mechanical sculpter.
	www.craftgallery.co.uk /links/pages/Automata (360 words)

Try your search on: Qwika (all wikis)