Automaton
Advertisement
Advanced HTTP Request Automaton v.1.4
Advanced HTTP Request Automaton is a scriptable utility that submits HTTP GET and POST requests to an Internet or Intranet address and persists HTTP responses to files.
Advertisement
Robot Automaton v.1.1
Run multiple commands with a simple command. Ever wish that you could make something automated, well now you can, with Robot Automaton! you can run multiple programs that will repeatedly do tasks with an initial instruction only.Requirements: *
K-automaton v.1.0
K-automaton is a new parsing (syntactic analysis) machine isomorphous to language.
Universal Cellular Automaton v.1.0
A Cellular Automaton simulator written in java (swing).
Automaton Lab 3D v.1.0
The 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.
Automaton Lab 3D Quantum v.1.0
The 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.
Advanced Database Query Automaton v.1.4
Scriptable Microsoft SQL Server and MySQL database client that persists SQL resultsets to CSV files.
Celeste Cellular Automaton Simulator v.2012.02.02
Celeste is a tiny and simple Cellular Automata simulator written in Java.
Five Cellular Automata v.7 70
A cellular automaton consists of: (a) A structure of cells, such as the squares on a chess board. (b) A set of values or 'states' such that each cell is associated with a particular state.
Active Task Manager
A compact automaton tool to set up and run unattended tasks. It starts exe, bat and com files, shuts down the system and displays text-sound reminders at scheduled moments or manually. The flexible scheduling capability allows you either to set time
SinkCell v.0.0.2
SinkCell is a small cellular automaton. Cellular automaton consist of an infinite number of cells, which have a finite number of states. These states change depending on the state of their neighbours. Each cell has the same rule for updating. The