This document summarizes a research paper on parallel communicating extended finite automata systems. The key points are:
1) Parallel communicating extended finite automata systems allow multiple extended finite automata to work independently in parallel while communicating with each other by request.
2) These systems are shown to be more powerful than existing models in terms of the computational languages they can accept, such as recursively enumerable languages.
3) An example system is provided to demonstrate how a non-context free language can be accepted by reading an input word using this model of parallel communicating extended finite automata.