![]() |
|
| Home > automata free download |
| Popular: | ||
| ||
| Sponsored links | ||
| TOP-10: | ||
| ||
| New: | ||
| ||
|
| 1. | CellFighter Game 2.5 | ||
| This program is an extension of the Game of Life that transforms the classical Life from an environment for various experiments into a genuine game with an active player and a clear goal: rival colonies of virtual germs wage a war against each other, and you takes part in this battle in real time as a | |||
| Updated: Mar 6, 2007 | Rating: 0 | Author: Sergey Startsev | Size: 512 kb | Shareware Go to category: Games > Puzzle Similar software |
| 2. | Five Cellular Automata 7.60 | ||
| state of the system. This is software for exploring five cellular automata, as follows: 1. An extended version of Conway's Life, called q-state Life. 2. A simulation of the Belousov-Zhabotinsky chemical reaction in which, beginning from a random state of the system, spirals and curlicues | |||
| Updated: Nov 5, 2009 | Rating: 387 | Author: Peter Meyer | Size: 1591 kb | Freeware Similar software |
| 3. | CellFighter 2.03 | ||
| This program is an extension of the Game of Life that transforms the classical Life from an environment for various experiments into a genuine game with an active player and a clear goal: rival colonies of virtual germs wage a war against each other, and you takes part in this battle in real time as a | |||
| Updated: Jul 20, 2004 | Rating: 0 | Author: Sergey Startsev | Size: 231 kb | Shareware Go to category: Games Similar software |
| 4. | Source Code Scanners for Delphi 6 4.0 Std | ||
| and etc.). The lexical analyzers uses DFAs (Deterministic Finite Automata) to match tokens found on the character input stream. DFAs are defined by the set of regular expressions in a source code and are created at runtime. More than one automaton (lexical class, lexical tree) may be defined. Actions attached to regular expressions (which are executed when that expression has beeno | |||
| Updated: Jul 20, 2004 | Rating: 16 | Author: MBLabSoft | Size: 1198 kb | Shareware Go to category: Development Tools Similar software |
| 5. | Source Code Scanners for Delphi 5 4.0 Std | ||
| and etc.). The lexical analyzers uses DFAs (Deterministic Finite Automata) to match tokens found on the character input stream. DFAs are defined by the set of regular expressions in a source code and are created at runtime. More than one automaton (lexical class, lexical tree) may be defined. Actions attached to regular expressions (which are executed when that expression has beeno | |||
| Updated: Jul 20, 2004 | Rating: 46 | Author: MBLabSoft | Size: 994 kb | Shareware Go to category: Development Tools Similar software |
| 6. | Source Code Scanners for C++ Builder 6 4.0 Std | ||
| and etc.). The lexical analyzers uses DFAs (Deterministic Finite Automata) to match tokens found on the character input stream. DFAs are defined by the set of regular expressions in a source code and are created at runtime. More than one automaton (lexical class, lexical tree) may be defined. Actions attached to regular expressions (which are executed when that expression has beeno | |||
| Updated: Jul 20, 2004 | Rating: 181 | Author: MBLabSoft | Size: 1169 kb | Shareware Go to category: Development Tools Similar software |
| 7. | Source Code Scanners for C++ Builder 5 4.0 Std | ||
| and etc.). The lexical analyzers uses DFAs (Deterministic Finite Automata) to match tokens found on the character input stream. DFAs are defined by the set of regular expressions in a source code and are created at runtime. More than one automaton (lexical class, lexical tree) may be defined. Actions attached to regular expressions (which are executed when that expression has beeno | |||
| Updated: Jul 20, 2004 | Rating: 0 | Author: MBLabSoft | Size: 1184 kb | Shareware Go to category: Development Tools Similar software |
| 8. | Automaton Lab 3D Quantum 1.0 | ||
| automata which are modeled in this application are composed of a set of spheres whose size and axis are relative to one another, and where each sphere is rolling upon the surface of one other sphere in a fully deterministic pattern in space and in time. The paths through space taken by one or more points within each sphere can also be visualized as the automaton carries out iso | |||
| Updated: Nov 8, 2007 | Rating: 0 | Author: Brian DiLoreto | Size: 1333 kb | Freeware Go to category: Education > Mathematics Similar software |
| 9. | Automaton Laboratory 1.0 | ||
| application is a laboratory for the creation of automata. An automaton is a system of circles (actually planar coordinate systems) moving relative to one another in a hierarchical fashion. That is, every circle in the system except one will be rolling along the circumference of one other circle at | |||
| Updated: Nov 5, 2007 | Rating: 0 | Author: Brian DiLoreto | Size: 46 kb | Freeware Go to category: Education > Mathematics Similar software |
| 10. | Automaton Lab 3D 1.0 | ||
| automata which are modeled in this application are composed of a set of spheres whose size and axis are relative to one another, and where each sphere is rolling upon the surface of one other sphere in a fully deterministic pattern in space and in time. The paths through space taken by one or more points within each sphere can also be visualized as the automaton carries out iso | |||
| Updated: Nov 15, 2007 | Rating: 0 | Author: Brian DiLoreto | Size: 772 kb | Freeware Go to category: Education > Mathematics Similar software |
| 11. | Source Code Scanners for C++Builder 2006 4.0 Std | ||
| and etc.). The lexical analyzers uses DFAs (Deterministic Finite Automata) to match tokens found on the character input stream. DFAs are defined by the set of regular expressions in a source code and are created at runtime. More than one automaton (lexical class, lexical tree) may be defined. Actions attached to regular expressions (which are executed when that expression has beeno | |||
| Updated: Nov 16, 2007 | Rating: 0 | Author: MBLabSoft | Size: 1433 kb | Shareware Go to category: Development Tools > Components & Libraries Similar software |
| 12. | Source Code Scanners for Delphi 2006 4.0 Std | ||
| and etc.). The lexical analyzers uses DFAs (Deterministic Finite Automata) to match tokens found on the character input stream. DFAs are defined by the set of regular expressions in a source code and are created at runtime. More than one automaton (lexical class, lexical tree) may be defined. Actions attached to regular expressions (which are executed when that expression has beeno | |||
| Updated: Dec 5, 2007 | Rating: 0 | Author: MBLabSoft | Size: 1465 kb | Shareware Go to category: Development Tools > Components & Libraries Similar software |
| 13. | CellFighter ScreenSaver 1.1 | ||
| This screen saver is based on an innovative extension of the Game of Life: two rival swarms of tiny critters wage a non-stop war for the screen space. The behavior of the living armies is highly amusing and unpredictable. The screen saver insensibly adds fresh forces to each army to enliven the show. You can | |||
| Updated: Jul 20, 2004 | Rating: 0 | Author: Sergey Startsev | Size: 142 kb | Shareware Go to category: Desktop > Screen Savers Similar software |
| 14. | CellFighter ScreenSaver 1.1 | ||
| This screen saver is based on an innovative extension of the Game of Life: two rival swarms of tiny critters wage a non-stop war for the screen space. The behavior of the living armies is highly amusing and unpredictable. The screen saver insensibly adds fresh forces to each army to enliven the show. You can | |||
| Updated: Jul 20, 2004 | Rating: 104 | Author: Sergey Startsev | Size: 142 kb | Shareware Similar software |
|
|
| Home > free automata software download |
|
See software by tags: Skinning opengl Personal desktop Winproxy download | see also: OutlookNormalizer Super DVD to PSP Converter for Mac Sothink Decompiler+Quicker Suite | See software by tags: Ip tunneling nntp Modem calls War chess | ||||
| Copyright © 20012009 3d2f Concept: Advertisement. |