"The Complexity of Testing Ground Reducibility for Linear Word Rewriting ..."

Gregory Kucherov, Michaël Rusinowitch (1994)

> Home

Details and statistics

DOI: 10.1007/3-540-60381-6_16

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ctrs/KucherovR94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ctrs/KucherovR94
Gregory Kucherov, Michaël Rusinowitch:
The Complexity of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables. CTRS 1994: 262-275

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.