Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable."

Viktor K. Sabelfeld (1981)

> Home

Details and statistics

DOI: 10.1016/0020-0190(81)90046-6

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Sabelfeld81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Sabelfeld81
Viktor K. Sabelfeld:
Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable. Inf. Process. Lett. 13(4/5): 147-153 (1981)

a service of

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.