"On the computational completeness of several descriptional complexity ..."

Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele (2025)

> Home

Details and statistics

DOI: 10.3233/COM-220427

access: closed

type: Journal Article

metadata version: 2025-09-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/computability/FernauKO25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computability/FernauKO25
Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele:
On the computational completeness of several descriptional complexity restrictions of semi-conditional grammars. Comput. 14(1): 3-16 (2025)

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.