"Deriving a Graph Rewriting System from a Complete Finite Prefix of an ..."

Rom Langerak (1999)

> Home

Details and statistics

DOI: 10.1016/S1571-0661(05)80293-2

access: open

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/entcs/Langerak99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/Langerak99
Rom Langerak:
Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding. EXPRESS 1999: 25-41

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.