State complexity of k-union and k-intersection for prefix-free regular languages

Hae Sung Eom, Yo Sub Han, Kai Salomaa

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Fingerprint

Dive into the research topics of 'State complexity of k-union and k-intersection for prefix-free regular languages'. Together they form a unique fingerprint.

Computer Science

Mathematics