"On the Complexity of Deciding Avoidability of Sets of Partial Words."

Brandon Blakeley et al. (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-02737-6_9

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dlt/BlakeleyBGR09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlt/BlakeleyBGR09
Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad:
On the Complexity of Deciding Avoidability of Sets of Partial Words. Developments in Language Theory 2009: 113-124

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.