The complexity of membership for deterministic growing context-sensitive grammarsFootnote^∗
^∗This research was partially supported by the National Science Foundation under Grant DCR- 8696097 and by the Organized Research Awards Program of the University of Texas at Dallas.

Sang Cho Computer Science Program, University of Texas at Dallas, Richardson, Texas, 75083, U.S.A.

Dung T. Huynh Computer Science Program, University of Texas at Dallas, Richardson, Texas, 75083, U.S.A.

References

Dahlhaus , E. and Warmuth , M. 1986 . Membership for growing context-sensitive grammars is polynomial . J. Comput. System. Sci , 33 : 456 – 472 .
Google Scholar
Hopcroft , J. and Ullman , J. 1979 . Introduction to Automata Theory, Languages, and Computation , Addison-Wesley Publishing .
Google Scholar
Krithivasan , K. and Narendran , P. 1987 . On the membership problem for some grammars , University of Maryland . Technical Report CS-TR-1787
Google Scholar
Warmuth M. Personal communication 1989
Google Scholar

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

The complexity of membership for deterministic growing context-sensitive grammarsFootnote^∗
^∗This research was partially supported by the National Science Foundation under Grant DCR- 8696097 and by the Organized Research Awards Program of the University of Texas at Dallas.

References

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

The complexity of membership for deterministic growing context-sensitive grammarsFootnote∗∗This research was partially supported by the National Science Foundation under Grant DCR- 8696097 and by the Organized Research Awards Program of the University of Texas at Dallas.

References

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date

The complexity of membership for deterministic growing context-sensitive grammarsFootnote^∗
^∗This research was partially supported by the National Science Foundation under Grant DCR- 8696097 and by the Organized Research Awards Program of the University of Texas at Dallas.