"Tight Lower Bound for the State Complexity of Shuffle of Regular Languages."

Cezar Câmpeanu, Kai Salomaa, Sheng Yu (2002)

> Home

Details and statistics

DOI: 10.25596/JALC-2002-303

access: closed

type: Journal Article

metadata version: 2020-05-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jalc/CampeanuSY02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jalc/CampeanuSY02
Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
Tight Lower Bound for the State Complexity of Shuffle of Regular Languages. J. Autom. Lang. Comb. 7(3): 303-310 (2002)

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.