Complexity results for prefix grammars

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.

[1]  J. Richard Büchi,et al.  Canonical systems which produce periodic sets , 2005, Mathematical systems theory.

[2]  Ann M. Singleterry.  Review: M. I. Kratko, Formal Post Calculi and Finite Automata , 1967 .

[3]  Michael Frazier,et al.  Prefix Grammars: An Alternative Characterization of the Regular Languages , 1994, Inf. Process. Lett..

[4]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, STOC '74.

[5]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[6]  Javier Esparza,et al.  Model-Checking LTL with Regular Valuations for Pushdown Systems , 2001, TACS.

[7]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[8]  Dirk Siefkes,et al.  Finite Automata, Their Algebras and Grammars , 1990 .

[9]  Holger Petersen.  Prefix Rewriting and Descriptional Complexity , 2000, J. Autom. Lang. Comb..

[10]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[11]  Richard J. Lipton,et al.  Alternating Pushdown and Stack Automata , 1984, SIAM J. Comput..

[12]  Javier Esparza,et al.  Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.

[13]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[14]  J. Hopcroft,et al.  A Linear Algorithm for Testing Equivalence of Finite Automata. , 1971 .

[15]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[16]  Sheila A. Greibach,et al.  A note on pushdown store automata and regular systems , 1967 .

[17]  Didier Caucal,et al.  On the Regular Structure of Prefix Rewriting , 1990, Theor. Comput. Sci..

[18]  Journal of the Association for Computing Machinery , 1961, Nature.

[19]  J. R. Büchi.  Regular Canonical Systems , 1964 .