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

ISSN： 0020-7160

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

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

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

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

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

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

Univalent Functions in Two-Dimensional Free Boundary Problems

By Vasil'ev Alexander

Acta Applicandae Mathematicae, Vol. 79, Iss. 3, 2003-01 ,pp. : 249-280

Springer Publishing Company

Access to resources Recommend Favorite

Adjoint Ideals and Gorenstein Blowups in Two-dimensional Regular Local Rings

By Hyry Eero

Mathematische Zeitschrift, Vol. 254, Iss. 4, 2006-12 ,pp. : 767-783

Springer Publishing Company

Access to resources Recommend Favorite