Minimizing Cover Tree Automata
碩士 === 國立臺灣大學 === 電機工程學研究所 === 94 === The thesis proposes the concept of cover tree automata. A cover tree automaton of a finite tree language L is a deterministic finite tree automaton (DFTA) which accepts L and possibly other terms higher than any term in L. We can use the minimal cover tree autom...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/11952442340603422637 |