Boolean automata are a generalization of finite automata in the sense that the 'next state'i i.e. the result of the transition function given a state and a letter, is not just a single state (deterministic automata) or a union of states (nondeterministic automata) but a boolean function of states. B
Representations of (M, R)-systems by categories of automata
β Scribed by M.W. Warner
- Publisher
- Springer
- Year
- 1982
- Tongue
- English
- Weight
- 349 KB
- Volume
- 44
- Category
- Article
- ISSN
- 1522-9602
No coin nor oath required. For personal study only.
β¦ Synopsis
Arbib in a paper entitled 'Categories of (M, R)-Systems' represents both simple (M, R)systems and those with varying genome as subcategories of the category of automata. An alternative characterisation of general (M, R)-systems as automata is proposed and two theorems on (M,R)-automata are proved. The two categories of automata, namely Arbib in a paper entitled 'Categories of (M,R)-Systems' represents both simple (M, R)systems with variable genetic structure, are compared.
V X" x O"
-O"x Y" B" x X"
π SIMILAR VOLUMES
Geosimulation is hailed as βthe next big thingβ in geographic modelling for urban studies. This book presents readers with an overview of this new and innovative field by introducing the spatial modelling environment and describing the latest research and development using cellular automata and mult