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
• المؤسسة: De La Salle University

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...