State complexity of subtree-free regular tree languages

Hae Sung Eom, Yo Sub Han, Sang Ki Ko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Fingerprint

Dive into the research topics of 'State complexity of subtree-free regular tree languages'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science