有限状态自动机-习题3.1、3.2

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

A binary tree is a 6-tuple $M=(\Sigma ,Q,V,r,c,\varphi ),$ where
a) Σ = { l , r } \Sigma = \{l,r\} Σ={l,r} is the alphabet
b) Q = V ∪ { ϕ } Q = V \cup \{\phi\} Q=V∪{ϕ} is the set of states,.
c) V = { v 1 , v 2 , . . . , v 2 } V = \{v_1,v_2,...,v_2\} V={v1​,v2​,...,v2​} is the set of nodes,
d)$r\in V$ is the root node and start state
e)$c:Q\times {\Sigma }^{\ast }\to Q$ is the transition function satisfying $\forall v\in V,\exists 1s\in {\Sigma }^{\ast },st.c(r,s)=v.$
f)$\varphi$ is the termianl state.

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

A tree is a 5-tuple $M=(\Sigma ,Q,V,r,c,\varphi ),$ where
a) Σ = { a 1 , a 2 , . . . , a n } \Sigma = \{a_1,a_2,...,a_n\} Σ={a1​,a2​,...,an​} is the alphabet
b) Q = V ∪ { ϕ } Q = V \cup \{\phi\} Q=V∪{ϕ} is the set of states,.
c) V = { v 1 , v 2 , . . . , v n } V = \{v_1,v_2,...,v_n\} V={v1​,v2​,...,vn​} is the set of nodes,
d)$r\in V$ is the root node and start state
e)$c:Q\times {\Sigma }^{\ast }\to Q$ is the transition function satisfying $\forall v\in V,\exists 1s\in {\Sigma }^{\ast },st.c(r,s)=v.$
f)$\varphi$ is the termianl state.