"Nonprimitive recursive complexity and undecidability for Petri net ..."

Petr Jancar (2001)

> Home

Details and statistics

DOI: 10.1016/S0304-3975(00)00100-6

access: open

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/Jancar01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Jancar01
Petr Jancar:
Nonprimitive recursive complexity and undecidability for Petri net equivalences. Theor. Comput. Sci. 256(1-2): 23-30 (2001)

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.