On the recognition of context-free languages using accepting hybrid networks of evolutionary processors

Author：  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.84, Iss.3, 2007-03, pp. : 273-285

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

Expressiveness and complexity of regular pure two-dimensional context-free languages

By Bersani Marcello M.  

International Journal of Computer Mathematics, Vol. 90, Iss. 8, 2013-08 ,pp. : 1708-1733

Taylor & Francis Ltd

Access to resources Recommend Favorite

Context-Free Series on Trees

By Bozapalidis S.  

Information and Computation, Vol. 169, Iss. 2, 2001-09 ,pp. : 186-229

Academic Press

Access to resources Recommend Favorite

Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules

By Choudhary Ashish   Krithivasan Kamala  

International Journal of Computer Mathematics, Vol. 86, Iss. 4, 2009-04 ,pp. : 567-576

Taylor & Francis Ltd

Access to resources Recommend Favorite

Context-Free Event Domains Are Recognizable

By Badouel E.   Darondeau P.   Raoult J-C.  

Information and Computation, Vol. 149, Iss. 2, 1999-03 ,pp. : 134-172

Academic Press

Access to resources Recommend Favorite

Computing a Context-Free Grammar-Generating Series

By Litow B.  

Information and Computation, Vol. 169, Iss. 2, 2001-09 ,pp. : 174-185

Academic Press

Access to resources Recommend Favorite