The equivalence between weighted top-down tree automata
Publish Year: 1396
نوع سند: مقاله ژورنالی
زبان: English
View: 316
This Paper With 7 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JKBEI-3-10_006
تاریخ نمایه سازی: 1 اردیبهشت 1397
Abstract:
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.
Keywords:
Authors
Maryam Ghorani
Department of Applied Mathematics and Computer Sciences, Shahrood University of Technology,Shahrood, Iran