Published March 28, 2016
| Version v1
Publication
PCol Automata: Recognizing Strings with P Colonies
Description
We introduce the concept of a P colony automaton, an automata-like con-
struct combining properties of finite automata and P colonies. We present some preliminary results on the accepting power of several variants of these extremely simple language
recognizing devices, and propose problems for future research.
Additional details
Identifiers
- URL
- https://idus.us.es/handle/11441/38990
- URN
- urn:oai:idus.us.es:11441/38990
Origin repository
- Origin repository
- USE