Context-Free Event Domains Are Recognizable

Author： Badouel E.   Darondeau P.   Raoult J-C.  

Publisher： Academic Press

ISSN： 0890-5401

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

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

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

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

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

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

By  

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free Language

By Gore V.   Jerrum M.   Kannan S.   Sweedyk Z.   Mahaney S.  

Information and Computation, Vol. 134, Iss. 1, 1997-04 ,pp. : 59-74

Academic Press

Access to resources Recommend Favorite