Generalized P Colony Automata and Their Relation to P Automata

We investigate genPCol automata with input mappings that can be realized through the application of finite transducers to the string representations of multisets. We show that using unrestricted programs, these automata characterize the class of recursively enumerable languages. The same holds for systems with all-tape programs, having capacity at least two. In the case of systems with com-tape programs, we show that they characterize language classes which are closely related to those characterized by variants of P automata

Distributed learning automata-based scheme for classification using novel pursuit scheme

Author's accepted manuscript.Available from 03/03/2021.This is a post-peer-review, pre-copyedit version of an article published in Applied Intelligence. The final authenticated version is available online at: http://dx.doi.org/10.1007/s10489-019-01627-w.acceptedVersio