摘要
Using Boolean operations and concatenation product w.r.t special trees,quantifier hierarchies are given by way of alternate existential and universal quantifiers for the first-order definable tree languages.
Using Boolean operations and concatenation product w.r.t special trees,quantifier hierarchies are given by way of alternate existential and universal quantifiers for the first-order definable tree languages.
基金
Project supported by the National Natural Science Foundation of China.
