"Finding the smallest binarization of a CFG is NP-hard."

Carlos Gómez-Rodríguez (2014)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2013.12.003

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/Gomez-Rodriguez14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/Gomez-Rodriguez14
Carlos Gómez-Rodríguez:
Finding the smallest binarization of a CFG is NP-hard. J. Comput. Syst. Sci. 80(4): 796-805 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.