"Operational State Complexity of Prefix-Free Regular Languages."

Yo-Sub Han, Kai Salomaa, Derick Wood (2009)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2009-05-17

- no documents available
- export record
  dblp key:
  - conf/birthday/HanSW09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/birthday/HanSW09
Yo-Sub Han, Kai Salomaa, Derick Wood:
Operational State Complexity of Prefix-Free Regular Languages. Automata, Formal Languages, and Related Topics 2009: 99-115

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.