On regular drawn symbolic picture languages

Author： Costagliola G. Deufemia V. Ferrucci F. Gravino C.

Publisher： Elsevier

ISSN： 0890-5401

Source： Information and Computation, Vol.187, Iss.2, 2003-12, pp. : 209-245

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

Related content

-regular languages

By Wang Shou-Feng

International Journal of Computer Mathematics, Vol. 88, Iss. 12, 2011-08 ,pp. : 2464-2484

Taylor & Francis Ltd

Access to resources Recommend Favorite

One-Unambiguous Regular Languages

By Bruggemann-Klein A. Wood D.

Information and Computation, Vol. 142, Iss. 2, 1998-05 ,pp. : 182-206

Academic Press

Access to resources Recommend Favorite

Context-Sensitive String Languages and Recognizable Picture Languages

By Latteux M. Simplot D.

Information and Computation, Vol. 138, Iss. 2, 1997-11 ,pp. : 160-169

Academic Press

Access to resources Recommend Favorite

A mathematical framework for the semantics of symbolic languages representing periodic time

By Egidi Lavinia

Annals of Mathematics and Artificial Intelligence, Vol. 46, Iss. 3, 2006-03 ,pp. : 317-347

Springer Publishing Company

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