Fingerprint
Dive into the research topics of 'State complexity of subtree-free regular tree languages'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
State complexity of subtree-free regular tree languages
Hae Sung Eom, Yo Sub Han, Sang Ki Ko
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2
Scopus
citations