Constructing an automaton graph representation for stack polygons and bar-graph polygons
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2009
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/7818 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |