2021-05-10-CSDN博客

本文链接：https://blog.csdn.net/weixin_42583186/article/details/116593999

机器学习的数学基础3：有限状态自动机

习题 3.1 模仿自动机的样子来重新定义二叉树.

答：

Definition： Let Σ = { l , r } be the alphbet and ϕ be a null node. A Btree is a tuple $T$ = ( $Q$ , $q_{0}$ , $T$ , $f$ ) ,where $Q$ is the set of states, $q_{0}$ ∈ $Q$ is the start state, $T$ ⊆Q is the set of terminal states, $f$ : $Q$ ×Σ∗→ $Q$ is the transition function.
a) $s$ ∈ Σ is accepted by the automata;∃1 $q_{0}$ ∈ $Q$ , iff $f$ ( $q_{0}$ , s ) ∈ $T$ .
b) ∀ $q$ ∈ $Q$ ,st. ∃1 $f$ ( $q$ , Σ)∈ $T$ .

c)∀ $q$ ∈ $Q$ , ∃ t∈ $T$ =ϕ.

d) ∀ $q$ ∈ $Q$ /ϕ, ∃1 q $_{next}$ ∈ $Q$ .

e)∀ $q$ =ϕ,∃1 q $_{next}$ = $q$ =ϕ.

习题3.2 模仿自动机的样子来重新定义树.

A tree is a tuple $T$ = ( $Q$ , $q_{0}$ , $T$ , $f$ ) ,where $Q$ is the set of states, $q_{0}$ ∈ $Q$ is the start state, $T$ ⊆Q is the set of terminal states, $f$ : $Q$ ×Σ∗→ $Q$ is the transition function.
a) $s$ ∈ Σ is accepted by the automata;∃1 $q_{0}$ ∈ $Q$ , iff $f$ ( $q_{0}$ , s ) ∈ $T$ .