CT-1995-02: A Note on the Complexity of Restricted Attribute-Value Grammars

CT-1995-02: Torenvliet, Leen and Trautwein, Marten (1995) A Note on the Complexity of Restricted Attribute-Value Grammars. [Report]

[img] Text (Full Text)
CT-1995-02.text.ps.gz

Download (112kB)
[img] Text (Abstract)
CT-1995-02.abstract.txt

Download (716B)

Abstract

The recognition problem for attribute­value grammars(AVGs) was shown to be undecidable by Johnson in 1988. Therefore, the general form of AVGs is of no practical use. In this paper we study a very restricted form of AVG, for which the recognition problem is decidable (though still NP­complete), the R­AVG. We show that the R­AVG formalism captures all of the context free languages and more, and introduce a variation on the so­called off­line parsability constraint , the honest parsability constraint , which lets different types of R­AVG coincide precisely with well­known time complexity classes.

Item Type: Report
Report Nr: CT-1995-02
Series Name: Computation and Complexity Theory (CT)
Year: 1995
Date Deposited: 12 Oct 2016 14:39
Last Modified: 12 Oct 2016 14:39
URI: https://eprints.illc.uva.nl/id/eprint/1064

Actions (login required)

View Item View Item