"An Improved Lower Bound on the Formula Complexity of Context-free Recognition."

Kurt Mehlhorn (1976)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2020-03-06

- no documents available
- export record
  dblp key:
  - journals/eik/Mehlhorn76
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eik/Mehlhorn76
Kurt Mehlhorn:
An Improved Lower Bound on the Formula Complexity of Context-free Recognition. J. Inf. Process. Cybern. 12(11/12): 523-524 (1976)

a service of

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.