"On the computational complexity of partial word automata problems."

Markus Holzer, Sebastian Jakobi, Matthias Wendlandt (2014)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2016-03-17

- no documents available
- export record
  dblp key:
  - conf/ncma/HolzerJW14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ncma/HolzerJW14
Markus Holzer, Sebastian Jakobi, Matthias Wendlandt:
On the computational complexity of partial word automata problems. NCMA 2014: 131-146

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.