Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Automatic feature extraction for autonomous general game playing agents
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Fluxplayer: a successful general game player
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
General game learning using knowledge transfer
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
General game playing in AI research and education
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
| Hi-index | 0.00 |
This paper describes and compares two simple, powerful models for formalizing the behavior of discrete dynamic systems: Propositional and Cell Automata. Propositional Automata encode state in terms of boolean propositions, and behavior in terms of boolean gates and latches. Cell Automata generalize the propositional model by encoding state in terms of multi-valued cells, and behavior in terms of comparators and selectors that respond to cell values. While the models are equally expressive, Cell Automata are computationally more efficient than Propositional Automata. Additionally, arbitrary Propositional Automata can be converted to optimal Cell Automata with identical behavioral properties, and Cell Automata can be encoded as a Propositional Automata with only logarithmic increase in size.