Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-15T11:11:30.492Z Has data issue: false hasContentIssue false
  • English
  • Français

Complexity results for prefix grammars

Published online by Cambridge University Press:  15 April 2005

Markus Lohrey and
Holger Petersen
Markus Lohrey
Affiliation:
University of Stuttgart, FMI, Universitätsstr. 38, 70569 Stuttgart, Germany; lohrey@informatik.uni-stuttgart.de; petersen@informatik.uni-stuttgart.de
Holger Petersen
Affiliation:
University of Stuttgart, FMI, Universitätsstr. 38, 70569 Stuttgart, Germany; lohrey@informatik.uni-stuttgart.de; petersen@informatik.uni-stuttgart.de
Get access

Abstract

Resolving an open problem of Ravikumar and Quan, we show that equivalence of prefix grammars is complete in PSPACE. We also showthat membership for these grammars is complete in P (it was known that this problem is in P) and characterize thecomplexity of equivalence and inclusion for monotonic grammars. For grammars with several premises we show that membershipis complete in EXPTIME and hard for PSPACE for monotonicgrammars.

Keywords

Rewriting systemsregular languagescomputational complexity

Information

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 39 , Issue 2 , April 2005, pp. 391 - 401
Copyright
© EDP Sciences, 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Büchi, J.R., Regular canonical systems. Archiv Math. Logik und Grundlagenforschung 6 (1964) 91–111.
J.R. Büchi, Finite Automata, their Algebras and Grammars. Springer, Berlin-Heidelberg-New York (1989).
Büchi, J.R. and Hosken, W.H., Canonical systems which produce periodic sets. Math. Syst. Theor. 4 (1970) 81–90. CrossRef
Caucal, D., On the regular structure of prefix rewriting. Theor. Comput. Sci. 106 (1992) 61–86. CrossRef
Chandra, A.K., Kozen, D.C. and Stockmeyer, L.J., Alternation. J. Association Computing Machinery 28 (2981) 114–133. CrossRef
Esparza, J., Hansel, D., Rossmanith, P. and Schwoon, S., Efficient algorithms for model checking pushdown systems, in Proc. of 12th International Conference on Computer Aided Verification (CAV), edited by E.A. Emerson and A.P. Sistla (Springer). Lect. Notes Comput. Sci. 1855 (2000) 232–247. CrossRef
Esparza, J., Kucera, A. and Schwoon, S., Model checking LTL with regular valuations for pushdown systems. Inform. Comput. 186 (2003) 355–376. CrossRef
Frazier, M. and Page Jr, C.D., Prefix grammars: An alternative characterization of the regular languages. Inform. Process. Lett. 51 (1994) 67–71. CrossRef
S.A. Greibach, A note on pushdown store automata and regular systems, in Proc. of the AMS 18 (1967) 263–268.
J.E. Hopcroft and R.M. Karp, A linear algorithm for testing the equivalence of finite automata. Report TR 71-114, Department of Computer Science, Cornell University (1971).
Jones, N.D. and Laaser, W.T., Complete problems for deterministic polynomial time. Theor. Comput. Sci. 3 (1977) 105–117. CrossRef
Kratko, M., Formal post calculi and finite automata. Problemy Kibernet. 17 (1966) 41–65. In Russian.
Ladner, R.E., Lipton, R.J. and Stockmeyer, L.J., Alternating pushdown and stack automata. SIAM J. Comput. 13 (1984) 135–155. CrossRef
A.R. Meyer and L.J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, in Proc. of the 13th Annual IEEE Symposium on Switching and Automata Theory, College Park (Maryland) (1972) 125–129.
C.H. Papadimitriou, Computational Complexity. Addison Wesley (1994).
Petersen, H., Prefix rewriting and descriptional complexity. J. Autom. Lang. Comb. 5 (2000) 245–254.
B. Ravikumar and L. Quan, Efficient algorithms for prefix grammars. Available at http://www.cs.sonoma.edu/~ravi (2002).
L.J. Stockmeyer and A.R. Meyer, Word problems requiring exponential time, in Proc. of the 5th ACM Symposium on Theory of Computing (STOC'73), Austin (Texas) (1973) 1–9.
H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser (1994).