500 search results - page 23 / 100 » Universality and Cellular Automata |
115
Voted
BIOADIT
2004
Springer
15 years 7 months ago
2004
Springer
After defining a Universe for computer science in opposition to the Universe of biology, this paper presents the roles that cellular division plays in both of them. Based on the ni...
122
Voted
FORMATS
2007
Springer
15 years 9 months ago
2007
Springer
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...
144
Voted
CALCO
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
136
Voted
JAC
2008
15 years 5 months ago
2008
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the result could actually...
147
Voted
CAV
2006
Springer
15 years 7 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...