No CrossRef data available.
Article contents
Complexity results for prefix grammars
Published online by Cambridge University Press: 15 April 2005
Abstract
Resolving an open problem of Ravikumar and Quan, we show that equivalence of prefix grammars is complete in PSPACE. We also show that membership for these grammars is complete in P (it was known that this problem is in P) and characterize the complexity of equivalence and inclusion for monotonic grammars. For grammars with several premises we show that membership is complete in EXPTIME and hard for PSPACE for monotonic grammars.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2005