Publisher
Open Publishing Association
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On the Strength of Unambiguous Tree Automata;International Journal of Foundations of Computer Science;2018-08
2. Measure properties of regular sets of trees;Information and Computation;2017-10
3. Unambiguous Büchi Is Weak;Developments in Language Theory;2016
4. An upper bound on the complexity of recognizable tree languages;RAIRO - Theoretical Informatics and Applications;2015-04