The Equivalence Between Weighted top-down Tree Automata
عنوان مقاله: The Equivalence Between Weighted top-down Tree Automata
شناسه ملی مقاله: ETECH03_018
منتشر شده در سومین کنفرانس ملی تکنولوژی مهندسی برق و کامپیوتر در سال 1396
شناسه ملی مقاله: ETECH03_018
منتشر شده در سومین کنفرانس ملی تکنولوژی مهندسی برق و کامپیوتر در سال 1396
مشخصات نویسندگان مقاله:
Maryam Ghorani - Department of Applied Mathematics and Computer Sciences Shahrood University of Technology Shahrood, Iran
خلاصه مقاله:
Maryam Ghorani - Department of Applied Mathematics and Computer Sciences Shahrood University of Technology Shahrood, Iran
This paper investigates the equivalence problem of weighted top-down tree automata over totally ordered lattices (or WTAs, for short). First, we define initialized WTA and some concepts corresponding to initialized WTA are given. Also, we prove the decidability of the equivalence problem for initialized WTAs. Next, we present an algorithmic procedure for deciding the equivalence between two initialized WTAs. Moreover, we analyze the complexity of the given algorithm. Finally, we give an example for the equivalence problem.
کلمات کلیدی: Weighted top-down tree automata; Equivalence problem; Totally ordered lattice
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/749183/