default search action

combined dblp search
author search
venue search
publication search

ask others

"Recognizing Rooted Context-free Flowgraph Languages in Polynomial Time."

Ulrike Lichtblau (1990)

> Home

Details and statistics

DOI: 10.1007/BFB0017411

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/gg/Lichtblau90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gg/Lichtblau90
Ulrike Lichtblau:
Recognizing Rooted Context-free Flowgraph Languages in Polynomial Time. Graph-Grammars and Their Application to Computer Science 1990: 538-548

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.