Constructing an automaton graph representation for stack polygons and bar-graph polygons

• 主要作者: Lapus, Raymond R.
• 格式: text
• 出版: Animo Repository 2009
• 主題: Polygons; Mathematics
• 在線閱讀: https://animorepository.dlsu.edu.ph/faculty_research/7818

An automaton A is a five-tuple (Σ, A, τ, ι, F) such that Σ is the collection of states; A is the alphabet set; τ: Σ x A → Σ is the transition function defined by τ ( s, a) s', for some s' ∈ Σ; ι ∈ Σ is the initial state; and a non-empty set F ⊆ Σ is the collection of final states. A is pi...