"On the linear computational complexity of the parser for quasi-context ..."

Janusz Jurek (2000)

> Home

Details and statistics

DOI: 10.1016/S0167-8655(99)00145-2

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/prl/Jurek00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/prl/Jurek00
Janusz Jurek:
On the linear computational complexity of the parser for quasi-context sensitive languages. Pattern Recognit. Lett. 21(2): 179-187 (2000)

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.