Skip to main content
Article thumbnail
Location of Repository

Are Very Large Context-Free Grammars Tractable?

By Pierre Boullier and Benoît Sagot
Topics: [ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [ INFO.INFO-CL ] Computer Science [cs]/Computation and Language [cs.CL]
Publisher: Springer
Year: 2010
OAI identifier: oai:HAL:inria-00516341v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.