Operational State Complexity of Subtree-Free Regular Tree Languages

Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han. Operational State Complexity of Subtree-Free Regular Tree Languages. Int. J. Found. Comput. Sci., 27(6):705-724, 2016. [doi]

Authors

Sang-Ki Ko

This author has not been identified. Look up 'Sang-Ki Ko' in Google

Hae-Sung Eom

This author has not been identified. Look up 'Hae-Sung Eom' in Google

Yo-Sub Han

This author has not been identified. Look up 'Yo-Sub Han' in Google