DESCRIPTIONAL COMPLEXITY OF GENERALIZED FORBIDDING GRAMMARS

Author: MEDUNA ALEXANDER   ŠVEC MARTIN  

Publisher: Taylor & Francis Ltd

ISSN: 0020-7160

Source: International Journal of Computer Mathematics, Vol.80, Iss.1, 2002-01, pp. : 11-17

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