Returning and non-returning parallel communicating finite automata are equivalent

Author: Choudhary Ashish   Krithivasan Kamala   Mitrana Victor  

Publisher: Edp Sciences

E-ISSN: 1290-385x|41|2|137-145

ISSN: 0988-3754

Source: RAIRO - Theoretical Informatics and Applications, Vol.41, Iss.2, 2007-07, pp. : 137-145

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract