"State Complexity of Combined Operations for Prefix-Free Regular Languages."

Hae-Sung Eom et al. (2014)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2020-03-19

- no documents available
- export record
  dblp key:
  - conf/birthday/EomHSY14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/birthday/EomHSY14
Hae-Sung Eom, Yo-Sub Han, Kai Salomaa, Sheng Yu:
State Complexity of Combined Operations for Prefix-Free Regular Languages. Discrete Mathematics and Computer Science 2014: 137-151

a service of

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.