2015 17th UKSIM-AMSS International Conference on Modelling and Simulation

Automata Design with Time Complexity for Intelligent Vending Machine based on
Visual Automata Simulator

Vijey Thayananthan, Ashwag Alrehily and Ruqiah Fallatah

Computer Science Department,
Faculty of Computing and Information Technology,
King Abdul Aziz University, Jeddah 21589,
Saudi Arabia
thayananthan@live.co.uk, ashwagalrehily@yahoo.com and rfallatah0008@stu.kau.edu.sa

Abstract—Automata theory and design are core areas of most
of the software developments which improves the efficiency of
the vending machines used in all sectors including academic
environments. We have studied and identified many problems
of vending machines which are convertible to intelligent
approach without increasing complexity. In this research,
improving efficiency and complexity reduction are considered
using appropriate automata design. In order to solve these
problems, we have employed efficient automata design and
visual automata simulator which allows us to increases the
efficiency of the vending machine. To verify our results, we
tested our design with different word lengths. As early results,
we have simulated the final design with selected feature which
adds intelligence to the existing automata design of vending
machine. In the overall conclusion, we prove that intelligent
feature can be added without increasing the complexity.
Keywords-automata theory; finite state machines; vending
machine; complexity; visual automata simulator;
I. INTRODUCTION
Alan Turing is the great scientist and he solved many
problems in automata design. Cash dispensers, vending
machines and other self-servicing machines depend on the
automata design. Computational development and automata
simulator tools also play a significant role in the efficient
designs. These days, computer video games are also
expecting significant changes which are not only in the
design and development but also in the improvement of
intelligent. These automata designs are implemented using
different simulators but we have considered visual automata
simulator (VAS) which is a new tool for this design. Also,
it's compatibility allows us to integrate with other tools.
Vending Machines are used to dispense various items
which are cash withdrawal, purchasing tickets, collecting
quick foods etc [1-3]. The first commercial coin-operated
machine was introduced in London and England used for
selling post cards. The vending machines are available to
which people are in working environments and other areas
such as public and private places. In future, vending
machines become mobile and intelligent approach because
they are more accessible and practical than the ordinary coin
operating machines [4-5]. Further, these machines are very
important for the medical services which need intelligent and
mobile features. Perhaps, we can extend these machines into
different services as well.
Some problems are computationally hard and others are
easy because the computational complexity is dominating in
all designs, developments and implementations. In all these
cases, the theories of computability and complexity are
closely related. Handling of complexity in all automata
design problems requires a precise definition of appropriate
computations used in the applications which include vending
machine. Reducibility and decidability in automata designs
play the important role in reducing complexity [6-7].
Intelligent vending machines (IVM) provide a number of
facilities with advanced features. They are anti-theft, facial
recognition etc. but they are controlled by the touch screen
which increases the efficiency of steps used in IVM.
Applications of Deterministic Finite Automata (DFA) are
communication protocol and microcontroller designs used
in electro-mechanical devices [8]. Intelligent approach to
design used in modern vending machines depends on the
efficient protocols and microcontrollers.
The rest of the paper is organized as follows. Section II
explains the quick literature review of basic and modern
vending machines which use conventional and intelligent
features. In section III, we provide necessary points about
the theory of automata design which is relevant to this
research. Section IV provides the steps of the algorithm
which we employ in this research. Implementation and
necessary results obtained from VASs are organized in
section V. In section VI, overall conclusions are written
based on the theoretical analysis and results.
II. LITERATURE REVIEW
Many researches have been investigated the architecture
of the vending machines. A few of them are discussed here
as: Fauziah Zainuddin [9] proposes a vending machine for
serving food in appropriate way. Here, researcher used three
different features in his design they are user selection state,
freezer state and steaming state.
In complexity theory, we classify computational
problems of vending machine design and increasing features
according to their time complexity. In some designs, the
same language takes different time requirements during the
processing. Here, design of the vending machines may be a

978-1-4799-8713-9/15 $31.00 © 2015 IEEE 159

DOI 10.1109/UKSim.2015.75
different approach. Space complexity of the vending
machines shares many of the features. Here, the time
complexity depends on the features we add in our designs.
Features based on intelligent approaches may be added
without increasing the complexities.
Mealy vending machine is basic approach used in oldest
coin operating machines. Still, existing and conventional
vending machines depend on Mealy approach. In this
approach [10], output and input are dependants each other.
Conventional vending machine used in this research is also
based on Mealy approach. In most of the vending machines,
DFA is considered to describe the behavior of the features
which depend on the nature of business and organization.
According to [10], multi-select vending machine is
proposed using Mealy approach. In this study, authors
observed the behavior of the design and implementation
used in the approach. Through this observation, time
analysis is compared during the operations [11]. This study
has helped us to continue our research which focuses on the
time complexity.
According to the [12], IVMs are available but still
controlling complexity is the biggest problems. According to
the recent research, few important points were suggested to
enhance the IVM. They are touch screen displays, cashless
system, telemetry system, voice recognition etc.
In previous automata designs, many software tools are
employed to analyze the results related to the complexity and
necessary parameters which reduce the cost of the IVM.
Here, we have introduced the VAS which allows us to
simplify the programming procedures. Commercially, some
existing designs based on automata theory are being
developed using VAS as in [13].
III. AUTOMATA THEORY AND T IME COMPLEXITIES
Automata theory is used in many disciplines and
applications based on mathematical models represented by
finite state machines (FSM) or automata. In this paper,
cashless system is considered as an example of intelligent
approach. Cashless system means that we are allowed to use
mobile phones and bank cards.
A. Definitions
To express the DFA as a 5-tuple, the components are
defined as follows:
1. K is the set of states (Saudi and other foreign
currencies. (SR, dollars, pounds, etc.) )
2.  is the alphabet or language
3.  is the transition function, is described by the state
diagram.
4. s is the start state
5. F is the set of accept states
In our design, FSA are classified as deterministic (DFA)
and nondeterministic (NFA). In DFA, the controller can
change from one state to another state but controller should
not be used in more than one state at any time. In NFA,
160
controller changes from one state to several states.
Generally, NFA increases the efficiency and power saving
during the operations. If time complexity is increased, we
need more power depended on the features based on
automata design.
B. Time complexity
Generally, length of the word used during the operation is
considered for calculating the time complexity. According to
[14], we define the nondeterministic time complexity class
t (n) NT as analogous to the deterministic time complexity
class t (n) T .
Definition: t (n) NT = {L|L is a language decided by a
O(t(n)) time nondeterministic vending machine}.
In our IVM design, the input to the algorithm is a
nondeterministic finite automaton M  ( K , , , s, F ) ; thus,
we must calculate its complexity as a function of the
cardinalities of K ,  and  .
The best method is known for solving languages in NP
deterministically uses exponential time (eT). In other words,
we can prove that
NP  eT   T (2
k
nk
) (1)
k
In (1), string length is assumed as at most n when k nodes
are used in the design. The class NP is insensitive to the
choice of reasonable nondeterministic computational model
because all such models are polynomially equivalent.
We assume that randomized FSM of IVM design M has
M
time complexity Tc (n)
Tc (n)maxn  Tc ( z ) 
M M
(2)
z  
M
Using (2), we can calculate Tc (n) which, is the maximal
expected running time of M over all words of length n.
 should be within the range.
n
Hence, on any input word z
When shorter strings are used during the transitions, the
time complexity decreases. It depends on the design of
features used in the vending machines. In IVM, operations
of the features can be reduced using automata theory [15-
16]. Basically, the time complexity depends on the upper
and lower bound of the word-lengths design which
influences with the number of steps used in the algorithms
and processing.
 IV. ALGORITHM DESCRIPTION AND PROPOSED DESIGN machine’s finite state diagram will visualize and simulated
After the design and analysis, we have developed using VAS. In this proposed design, VAS and its operations
following algorithms which could be applicable not only in take important roles in our time-complexity analysis.
the specific vending machine but also other developments Although vending machines already exist, analysis of time
such as games provided through mobile and wireless service complexity will improve the functionalities of future IVM.
providers. C. Methodology
A. Algorithm In this paper, we prefer to use VAS tool to describe the
The cashless is one of the example features used for design methodology of proposed vending machines which
making IVM. Necessary steps are given below. include IVM. Using our algorithm, the time complexity is
analyzed for different word lengths used in our approaches.
Input: user selection and desired currency ={K1, K2…} Although VAS is a helpful tool for simulating FSA, we have
used this tool for experiments which are comparisons of
Output: proposed vending machine which accepts (a) or
basic and intelligent features. In these two approaches,
rejects (r) string. average time complexity is calculated using selected
Initialize: initial state, count =0. features, counted word-lengths, steps, processing and other
1. User, select one book from the four available books parameters used in the automata theory.
2. If the user enters e then
3. Go to “select 1“state. (Language)
4. Else If user enters a then V. IMPLEMENTATION AND RESULTS
5. Go to “select 2“state. (Main category or field) The proposed vending machine is simulated using the
6. Else If user enters n then latest version of VAS tool which allows us to handle the
7. Go to “select 3“state. (Topic) intelligent feature. Each word used in the transition of FSM
8. Else If user enters a then represents the behavior of the conventional and proposed
9. Go to “select 4“state. (Specific) design with corresponding states and transitions. As soon as
10. Else the machine reaches accepting state, the IVM delivers the
11. Reject the message. book. In order to understand the processing, basic coin
12. End if operation is used in each transition of conventional vending
13. Repeat{ machine. In these operations, we can add this intelligent
14. If the user enters first total: feature "cashless payment" without changing main
15. Count=count + first total {c} architecture. In this design, states which have two circles, are
16. Go to “count” state and word length. accepting state.
17. Else user enters second total: A. Implementation of accepting operation
18. Count=count + second total {c}
The user select Arabic book and enter 10,10,10,10 and
19. Go to “count” state and word length.
ten respectively and table 1 shows this transition table for
20. End If
serving book using the book vending. Thus, the string is
21. } until (no money in the bank);
a11111b. The Final b inserted refer to the end of the
22. If count = book price then
operation; it is only used for explains the debug steps until
23. Accept (a) message with total word length.
accept state. Table I shows the transition states for accept
24. Else
operation; the user will implement the flowing transition in
25. Reject (r) the message with total word length.
order to receive the book he wants. In this processing, we
26. End If
observed time complexity with other existing software tools.
27. End
To analyze the time complexity, automata technique and
.
each operation used in the design studied with different
strings.
B. Description of vending machine
TABLE I. TRANSITION DETAILS FOR SERVING BOOK
Here, basic operation of vending machine is described with
necessary features. It is a multi-select books machine with Selected string a11111b
FSM based. It is improved to deliver books depending on the symbol Remaining string States
user selection for a specific type of available books, and then a 11111b [Select 2], accepting = false
touch the screen which shows the amount of money in Saudi 1 1111b [10SR], accepting = false
Riyal (SR) or other foreign currency. Cancel feature; that 111b
1 [20SR], accepting = false
means the customer can discard the ordering of product and
1 11b [30SR], accepting = false
end the buying operation. The user does not need to insert
the money which is equal to the price of the book he/she 1 1b [40SR], accepting = false
wants. This intelligent approach allows us to increase some 1 b [50SR], accepting = True
more intelligent features without increasing complexity. Our

161
 For instance, four books and two Saudi Riyals (10 and
20) are considered to show this processing which needs
twenty states. Assume that the price of the Arabic book and
English book is the same. Thus; the transition from Select 2
goes to the same transition of select 1. So the state diagram
only shows the 16 states excluding the five states of select 2.
The Initial State, when the machine is ready to perform
the sale operation. Assume that the machine uses fixed
length of the word for which selected abbreviation is used
during the sales. After the selection of book type, the user
has to insert the money which is the amount of the specific
book. In this case an Arabic book requires 50 SR. At the
first time, the user may insert 10SR and continue or user can
use a single payment.
Figure 1. Example of Mealy vending machine behaviors
B. Implementation of rejecting operation
When intelligent feature is used, rejections operations
will be considered in different ways. But, we have
illustrated this operation through the conventional vending
machine. The example of rejecting scenario is the user
select notebook and enters 10, 10 and cancel the order.
Table II shows this transition table for serving note using
vending machine. Thus, the string is n11c.After the
selection of book type, the user has to insert the money
amount of a specific book. In this case notebook requires
30SR. At the first time, the user has to insert 10SR. Using
162
As shown in figure 1, basic coin operation of vending
machine can be built. In the conventional vending machine,
basic features mentioned in [10] are used. The user can still
select different operations which allow him/her to choose
either intelligent or conventional feature. Each case, word
length should be considered carefully. Otherwise overall
time complexity will be increased.
In figure 1, the transition from the initial state (v0) to
other states (v1, v2 and v3), which represents some behavior
of Mealy vending machine. In this, there is no accepting or
rejecting state, but one of the states should be assumed as an
output state. In this example, q0, n and d are inputs, and c0,
c1, c2 and c3 are outputs. Letter "e" represents empty
transition.
the transition with number 1 (symbol for 10 SR.) and the
remaining amount will equal to 20 SR.
TABLE II. TRANSITION DETAILS FOR SERVING BOOK
Selected string n11c
symbol Remaining string States
n 11c [Select 3], accepting = false
1 1c [10SR], accepting = false
1 c [20SR], accepting = false
 Again time complexity is analyzed as in automat theory
and VAS. These existing designs encourage us to add the
intelligent feature which not only provides the intelligent
action but also reduce the cost. The user still inserting
another 10 SR. and the reminder of the note price 30 will
equal to 10 SR. Figure 2 can be used to show the transition
of second 10 SR. Then the user decides to cancel the
operation; because of that the operation was rejected. The
cancel operation accepted only when the user decides to
cancel the operation before inserting money.
C. Cashless operation of intelligent behavior
As shown in figure 2, we have designed the IVM with
same number of states and transitions. In this design, instead
Figure 2. State diagram of IVM with a cashless feature
D. Results of Simulations
Our simulation takes string from the user; the string
includes the selected book, money (all type of currencies),
and cancels if user wants to cancel. The summation runs the
string in the state diagram and as a result it accepts or rejects
for the entered string, if the string is accepted the book
delivered otherwise it will not deliver the book. Regarding
the complexity, when we increase the features, a number of
states used in the IVM design should be increased but some
cases, design may be possible without increasing states
using automata theory. Here, the time complexity is
calculated for each word length. When 100 bits are used
average time complexity almost 10. When more than 600
bits are used average time complexity is between 60 and 70.
As shown in figure 3, the time complexity is compared
to both existing and proposed methods. Different word
lengths are considered to analyze the time complexity of
both machines. In the conventional vending machine, the
time complexity is increased. existing method, The time
163
of using coins, we can use credit cards or mobile phones
which link with the banks. In this paper, the specific
processing of IVM is not considered because we assume
that steps for the intelligent feature “cashless” are equal to
coin operation. Although steps are same in each case, word
length which we use in these operations may be different.
Each operation may have different processing which
depends on the features. Overall, types of feature,
operations, steps and processing are very important to
analyze the complexity. We assume that the bank pays the
final total through cashless payment method when state
diagram reaches the accepting state.
complexity depends on the number of iterations and steps
we use in the automata design of IVM. Even though same
number of states we use in both coin operation and cashless
operation designs, language and word length of the
corresponding operation may be different. These differences
certainly affect the time complexity which we have
analyzed using necessary graphs. Note that an automaton
with time complexity T(n) must have expected running time
at most T(n) on any word of length n. In other words, a fast
randomized automaton must work fast also for words not in
the solved language.
From the results, we can prove that reduction of the time
complexity will increase processing speed because steps
used in our designs and simulations are minimized using
appropriate word lengths. Instead of using cash (coin),
intelligent feature “cashless” will increase the safety and
security. As reviewers advised, we should have covered
some more points such as experiments and proves on speed,
safety and security. Because of the page limitation, we will
add necessary experiments and proves in our extended paper
very soon.
 Time complexity of conventional vending machine Time complexity of intelligent vending machine
80 70
Existing Existing
Proposed Proposed
70 60

60 50
Complexity T(n)

Complexity T(n)
50 40

40 30

30 20

20 10

10 0
100 200 300 400 500 600 700 800 900 100 200 300 400 500 600 700 800 900
Lengths of words (n) Lengths of words (n)

Figure 3. Time complexity comparisons for conventional (left figure) and intelligent vending machine (right figure)

VI. CONCLUSIONS
The design of vending machine based on automata theory
is studied. We have identified few intelligent features which
are very useful and profitable because it not only minimizes
the cost and complexity but also it increases the processing
speed, safety and security. We studied the VAS and its
features which monitor the time complexity dynamically.
Through these designs and implementations, we identified
that VAS could be a reliable tool to improve the efficiency
and accuracy of intelligent features expected to integrate
with future vending machines. In future work, we will have
to analyze the time complexity of other features which are
applicable to future IVM.
REFERENCES
[1] Zhang Wen & Zhang Xin Long, “Design and Implementation of
automatic vending machine Based on the short massage payment”
International Conference on Information and Communications
technology in Electrical Sciences, Neijiang, Sichuan, China.pp.978-
981, 2010.
[2] B. Caulfield & M.O Mahony, “Passenger Requirements of a Public
Transport Ticketing System” Proceedings of the 8th International
IEEE Conference on Intelligent Transportation Systems Vienna,
Austria, pp-32-37, 2005.
[3] Biplab Roy & Biswarup Mukherjee “Design of Coffee Vending
Machine using Single Electron Devices” Proceedings of 2010
International Symposium on Electronic System Design. Pp. 38-43,
2010.
[4] M.Bhuvaneswari, S.Sukhumar, N.Divya, S.Kalpanadevi,
N.SuthanthiraVanitha, "Embedded System Based Automatic Ticket
Vending Machine for Modern Transport System", International
Journal of Advanced Research in Computer and Communication
Engineering Vol. 2, Issue 11, 2013.
[5] Sakshi Sharma, Ana Monga, "Implementation of Reverse Vending
Machine Based on FPGA", International Journal of Emerging
Technologies in Computational and Applied Sciences (IJETCAS),
2011.
[6] Hopcroft, John E. and Jeffrey D. Ullman, "Introduction to Automata
Theory, Languages, and Computation", Reading, MA, Addison-
Wesley, 1979.
[7] Michael Sipser, "Introduction to the Theory of Computation",
Second Edition Massachusetts Institute of Technology, ISBN 0-534-
95097-3, 2006, USA
[8] Qureshi, M., Aziz, A., Rasool, H., Ibrahim, M., Ghani, U. and Abbas,
H, "Design and Implementation of Vending Machine using Verilog
HDL". 17, 2011.
[9] Fauziah Zainuddin, Norlin Mohd Ali, Roslina Mohd Sidek, Awanis
Romli, Nooryati Talib & Mohd. Izham Ibrahim, “Conceptual
Modeling for Simulation: Steaming frozen Food Processing in
Vending Machine” International Conference on Computer Science
and Information Technology,University Malaysia Pahang, pp.145-
149, 2009.
[10] Varkey, M. and Sunny, J. "Design and Implementation of Multi
Select Smart Vending Machine". International Journal of Computer
Networks and Wireless Communications (IJCNWC), ISSN: 2250-
3501, 2014.
[11] Ana Monga, Balwinder Singh. "Finite State Machine based Vending
Machine Controller with Auto-Billing Features. International Journal
of VLSI design & Communication Systems (VLSICS) Vol.3, No.2,
2012.
[12] Frost & Sullivan*, “Assessment of the Intelligent Vending Machines
Market, November 2011.
[13] Jean Bovet, “visual automata simulator tool”, laboratory manual,
USA.
[14] Cynthia Dwork and Larry J. Stockmeyer. A time complexity gap for
twoway probabilistic fnite-state automata. SIAM Journal on
Computing, 19(6):1011-1123, 1990.
[15] Dash, T. and Nayak, T. "Quantum Finite Automata: a Language
Acceptor Model", International Journal of Advanced Research in
Computer Science and Software Engineering, Volume 2, Issue 9,
September 2012.
[16] John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, “Introduction
to Automata Theory Languages and Computation”. Ch-1, 27-29, 3rd
Edition Cornell University, Stanford University, California, 2001,
USA.

164