Characterizing unambiguous precedence systems in expressions without superfluous parentheses

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.86, Iss.1, 2009-01, pp. : 1-20

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

Distinguishing redundant parentheses by syntax

By Bates Rodney

International Journal of Computer Mathematics, Vol. 82, Iss. 8, 2005-08 ,pp. : 951-967

Taylor & Francis Ltd

Access to resources Recommend Favorite

Characterizing the computational power of energy-based P systems

By Alhazov Artiom Antoniotti Marco Leporati Alberto

International Journal of Computer Mathematics, Vol. 90, Iss. 4, 2013-04 ,pp. : 789-800

Taylor & Francis Ltd

Access to resources Recommend Favorite

Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems

By Godoy Guillem

Applicable Algebra in Engineering, Communication and Computing, Vol. 15, Iss. 1, 2004-06 ,pp. : 13-36

Springer Publishing Company

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

Sequential precedence tests

Statistics, Vol. 49, Iss. 1, 2015-01 ,pp. : 224-238

Taylor & Francis Ltd

Access to resources Recommend Favorite