A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE(2024)
摘要
We consider weighted tree automata (wta) over bounded lattices, locally finite bounded lattices, distributive bounded lattices, and finite chains and we consider the weighted tree languages defined by their run semantics and by their initial algebra semantics. Due to these eight combinations, there are eight sets of weighted tree languages. Moreover, we consider the four sets of weighted tree languages which are recognized by crisp-deterministic wta over the above mentioned sets of weight algebras. We give all inclusion relations among all these twelve sets of weighted tree languages. More precisely, we prove that eleven of the twelve sets are equal, and this set is a proper subset of the set of weighted tree languages recognized by wta over bounded lattices with initial algebra semantics.
更多查看译文
关键词
weighted tree automata,bounded lattices,run semantics,initial algebra semantics,inclusion relations
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要