"The Computational Complexity of PCGS with Regular Components."

Liming Cai (1995)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2017-05-26

- no documents available
- export record
  dblp key:
  - conf/dlt/Cai95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlt/Cai95
Liming Cai:
The Computational Complexity of PCGS with Regular Components. Developments in Language Theory 1995: 209-219

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.