| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2020: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2019: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2018: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2017: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Outline of Final Research Achievements |
Formal tree language theory is a theory of tree automata and tree transducers for a formal model of tree-structured data, and is expected to be applied to efficient and verifiable software. In this research project, we have studied the relation between several classes of tree transducers and succeeded in showing that the class of stream-type tree transducers that is considered efficient corresponds to the largest class in which the equivalence problem is decidable. The results of this research are expected to lead to the development of some efficient program verification algorithms.
|
