500 search results - page 60 / 100 » Universality and Cellular Automata |
CONCUR
2001
Springer
14 years 2 months ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
The iterated prisoner’s dilemma is a widely used computational model of cooperation and conflict. Many studies report emergent cooperation in populations of agents trained to p...
ATVA
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...
FUIN
2002
13 years 10 months ago
2002
One-way and two-way cellular language acceptors with restricted nondeterminism are investigated. The number of nondeterministic state transitions is regarded as limited resource wh...
CONCUR
2012
Springer
12 years 16 days ago
2012
Springer
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...