In this paper, a new tree automata based machine, XEBT, is proposed to solve the problem.
提出了基于树自动机的XEBT机来解决这个问题。
This paper proposes a condition of timed tree automata recognizing language, proves the correctness of its.
本文提出了时间树自动机识别语言的一个条件,并证明了结论的正确性。
This paper proposes a condition of timed tree automata recognizing language, proves the correctness of its.
本文提出了时间树自动机识别语言的一个条件,并证明了结论的正确性。
应用推荐