"Complexity of Proper Suffix-Convex Regular Languages."

Corwin Sinnamon (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-319-94812-6_27

access: closed

type: Conference or Workshop Paper

metadata version: 2018-07-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wia/Sinnamon18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wia/Sinnamon18
Corwin Sinnamon:
Complexity of Proper Suffix-Convex Regular Languages. CIAA 2018: 324-338

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.