"An approximate matching algorithm for finding (sub-)optimal sequences in ..."

Jérôme Waldispühl, Behshad Behzadi, Jean-Marc Steyaert (2002)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2005-05-06

- no documents available
- export record
  dblp key:
  - conf/eccb/WaldispulBS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eccb/WaldispulBS02
Jérôme Waldispühl, Behshad Behzadi, Jean-Marc Steyaert:
An approximate matching algorithm for finding (sub-)optimal sequences in S-attributed grammars. ECCB 2002: 250-259

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.