"Nonterminal complexity of one-sided random context grammars."

Alexander Meduna, Petr Zemek (2012)

> Home

Details and statistics

DOI: 10.1007/S00236-012-0150-6

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/acta/MedunaZ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/acta/MedunaZ12
Alexander Meduna, Petr Zemek:
Nonterminal complexity of one-sided random context grammars. Acta Informatica 49(2): 55-68 (2012)

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.