Complexity results for prefix grammars
University of Stuttgart, FMI,
Germany; email@example.com; firstname.lastname@example.org
Accepted: 5 July 2004
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.
Mathematics Subject Classification: 03D03 / 68Q17 / 68Q42 / 68Q45
Key words: Rewriting systems / regular languages / computational complexity
© EDP Sciences, 2005