"State Complexity of k-Parallel Tree Concatenation."

Yo-Sub Han, Sang-Ki Ko, Kai Salomaa (2017)

> Home

Details and statistics

DOI: 10.3233/FI-2017-1560

access: closed

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fuin/HanKS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/HanKS17
Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
State Complexity of k-Parallel Tree Concatenation. Fundam. Informaticae 154(1-4): 185-199 (2017)

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.