RAIRO-Theor. Inf. Appl.
Volume 39, Number 2, April-June 2005
|Page(s)||391 - 401|
|Published online||15 April 2005|
Complexity results for prefix grammars
University of Stuttgart, FMI,
Germany; firstname.lastname@example.org; email@example.com
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.