Converse of object

• base: What the book is about therefore is, how to do cellular automata based modeling of social dynamics with Mathematica.

• use: An alternative way to model these processes is to use a cellular automata ( CA ) model to describe the cells.

• time: Abstract We address the issue of modeling a simple timeout in timed automata.

• build: He invented the coin lock as used in pay toilets, several proportionally spaced typewriters and he built numerous automata.

• make: Personal profile: Hobbies include marathon running, hill walking, skiing, sailing, horology, etching, photography and making automata.

• find: Netster.com makes it fast and easy to find automata wooden toys Huge Central Virginia Toy Store Harry Potter, too!

Adjective modifier

• cellular: First of all we mention the concept of cellular automata.

• pushdown: Pushdown automata: [ 4 lectures ] context-free grammars, limits of pushdown automata.

• finite: Necessary algorithmic problems are then solved by converting types to finite tree automata.

• deterministic: Content Introduction to theory of machines: [ 4 lectures ] deterministic finite automata, regular languages, nondeterministic finite automata.

• probabilistic: Keywords: duration calculus, real-time systems, probabilistic automata, satisfaction probability.

• mere: And how can I know whether others have minds - that they are not mere automata?

Modifies a noun

• theory: The thrust: a cellular automata theory of everything.

• maker: Wolfgang von Kempelen on the Web Links collection for the 18th-19th century automata maker.

• approach: HEGSELMANN R ( 1996 ) " Understanding social dynamics: The cellular automata approach " .

• kit: The exhibition includes a shop area where limited edition automata, automata kits and other ingenious gifts can be bought.

• exhibition: In this release, you will find the following new features: An interview from The Sunday Telegraph about Gilliam's new automata exhibition!

Noun used with modifier

• state: Application domains include digital circuit design, image filter design, and finite state automata induction.

• pushdown: However, equivalence questions for the deterministic case, whether two grammars or pushdown automata generate the same language or tree are open.

• tree: Necessary algorithmic problems are then solved by converting types to finite tree automata.