"The Computational Complexity of Universality Problems for Prefixes, ..."

Narad Rampersad, Jeffrey O. Shallit, Zhi Xu (2012)

> Home

Details and statistics

DOI: 10.3233/FI-2012-680

access: closed

type: Journal Article

metadata version: 2022-04-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fuin/RampersadSX12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/RampersadSX12
Narad Rampersad, Jeffrey O. Shallit, Zhi Xu:
The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages. Fundam. Informaticae 116(1-4): 223-236 (2012)

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.