Returning and non-returning parallel communicating finite automata are equivalent

Author： Choudhary Ashish Krithivasan Kamala Mitrana Victor

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

Related content

Systems of parallel communicating restarting automata

By Vollweiler Marcel Otto Friedrich

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 1, 2014-03 ,pp. : 3-22

Edp Sciences

Access to resources Recommend Favorite

Challenges to Returning Public Access Swimming to the Charles River in an Urban Environment

By Greene Karen Patterson Nelson Mike Hellweger Ferdi

Proceedings of the Water Environment Federation, Vol. 2010, Iss. 2, 2010-01 ,pp. : 913-927

Water Environment Federation

Access to resources Recommend Favorite

The Application of Floyd Algorithm for Returning Path Algorithm with Constraints of Time and Limit of Load

MATEC Web of conference, Vol. 63, Iss. issue, 2016-07 ,pp. : 05027-05027

Edp Sciences

Access to resources Recommend Favorite

Quantum finite automata with control language

By Mereghetti Carlo Palano Beatrice

RAIRO - Theoretical Informatics and Applications, Vol. 40, Iss. 2, 2006-07 ,pp. : 315-332

Edp Sciences

Access to resources Recommend Favorite

Atypical hyperpachymorph Trypanosoma (Nannomonas) congolense forest-type in a dog returning from Senegal

By Desquesnes M. Ravel S. Deschamps J.-Y. Polack B. Roux F.

Parasite, Vol. 19, Iss. 3, 2012-12 ,pp. : 239-247

Edp Sciences

Access to resources Recommend Favorite