HU Fu, HUANG Zhao-hua. Hyper-Minimization for Tree Automaton[J]. Journal of nanchang hangkong university(Natural science edition), 2015, 29(2): 27-32. DOI: 10.3969/j.issn.1001-4926.2015.02.005
Citation: HU Fu, HUANG Zhao-hua. Hyper-Minimization for Tree Automaton[J]. Journal of nanchang hangkong university(Natural science edition), 2015, 29(2): 27-32. DOI: 10.3969/j.issn.1001-4926.2015.02.005
shu

Hyper-Minimization for Tree Automaton

    Abstract
  • A new hyper-minimization algorithm of tree automaton was proposed in this paper. The deterministic tree automaton was transformed into deterministic finite automaton, then according to partitioned states into f-equivalence class and merged f-equivalence states algorithm of deterministic finite automaton, used hyper-minimization to the transformed automaton, got the final tree automaton which has finite differences. Compared with the exist algorithm, this algorithm is more simple and effectively, so it is an effective and easy-used algorithm.
    • FullText(HTML)
  • loading
    • References (8)
    • Relative Articles
  • Supplements (0)

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return