The essential relationship and equal value transformation of Non-FiniteAutomat, FiniteAutomat and Gauge FiniteAutomat (abbreviated as NFA, FA & GFA) is studied.
研究了不确定有穷自动机NFA、确定有穷自动机FA、规范有穷自动机GFA的基本关系与等价转换;
2
We extend finite automata with time sequence and define temporal finite automata, then we propose using temporal finiteautomat to build formal model for data fusion system.