"State Complexity of k-Union and k-Intersection for ..."

Hae-Sung Eom, Yo-Sub Han, Kai Salomaa (2015)

> Home

Details and statistics

DOI: 10.1142/S0129054115500124

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/EomHS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/EomHS15
Hae-Sung Eom, Yo-Sub Han, Kai Salomaa:
State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. Int. J. Found. Comput. Sci. 26(2): 211-228 (2015)

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.