367 search results - page 15 / 74 » Cellular automata |
JAC
2008
13 years 10 months ago
2008
Abstract. We consider simulations of graph automata. We introduce two local transformations on the neighborhood: splitting and merging. We explain how to use such transformations, ...
ICGI
2010
Springer
13 years 9 months ago
2010
Springer
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
TSMC
2010
13 years 3 months ago
2010
The cellular learning automaton (CLA), which is a4 combination of cellular automaton (CA) and learning automaton5 (LA), is introduced recently. This model is superior to CA because...
CONCUR
1998
Springer
14 years 29 days ago
1998
Springer
CORR
2011
Springer
13 years 3 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...