<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06091862</id>
  <dt>j</dt>
  <an>06091862</an>
  <augroup>
    <au>Li, Yu</au>
    <au>Deng, Peimin</au>
  </augroup>
  <ti>Some algebraic properties and corresponding language on finite fuzzy tree automata.</ti>
  <so>Fuzzy Syst. Math. 25, No. 6, 75-80 (2011).</so>
  <py>2011</py>
  <pu>National University of Defense Technology, Hunan; China National Publishing Industry Trading Corporation, Beijing</pu>
  <lagroup>
    <la>ZH</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>fuzzy tree automata</ut>
    <ut>homomorphism</ut>
    <ut>completeness</ut>
    <ut>admissible relation</ut>
    <ut>tree language</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: In this paper, we introduce some concepts of fuzzy finite state machines such as homomorphism, completeness, admissible relation to some algebraic properties on finite fuzzy tree automata, and the authors discuss them from the view of the algebra. We also discuss some tree language related questions of finite fuzzy tree automata.</ab>
    <rv></rv>
  </abgroup>
</item>