Operational State Complexity of Subtree-Free Regular Tree Languages

Sang Ki Ko, Hae Sung Eom, Yo Sub Han

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Fingerprint

Dive into the research topics of 'Operational State Complexity of Subtree-Free Regular Tree Languages'. Together they form a unique fingerprint.

Computer Science