Skip to main content
Conference Proceedings

A fast algorithm to decide on simple grammars equivalence

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1989) 401 LNCS 66-85
DOI: 10.1007/3-540-51859-2_8
12Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an algorithm to decide on simple grammars equivalence. Its complexity in time and space is polynomial in the valuation and the length of the description of the compared grammars, and exponential if we only take the last parameter into account. From this algorithm, we deduce an optimal upper bound of the number of parallel derivations to be applied to decide on equivalence.

Cite

CITATION STYLE

APA

Caucal, D. (1989). A fast algorithm to decide on simple grammars equivalence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 401 LNCS, pp. 66–85). Springer Verlag. https://doi.org/10.1007/3-540-51859-2_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free