APPLICATION OF THEORY OF AUTOMATA IN COMPUTER GAME DESIGNING

Case Study > APPLICATION OF THEORY OF AUTOMATA IN COMPUTER GAME DESIGNING

Riphah International University Rawalpindi Campus COMPUTER S 103 APPLICATION OF THEORY OF AUTOMATA IN COMPUTER GAME DESIGNING Sahar Arooj#1 Muhammad Mohsin#2 Atif Masih#3 Faculty Of Computing Faculty Of Computing Kasur, Pakistan Riphah International University, Riphah International University, [email protected] Lahore,P ...[Show More]

Riphah International University Rawalpindi Campus
COMPUTER S 103
APPLICATION OF THEORY OF

AUTOMATA IN COMPUTER GAME

DESIGNING

Sahar Arooj#1 Muhammad Mohsin#2 Atif Masih#3

Faculty Of Computing Faculty Of Computing Kasur, Pakistan

Riphah International University, Riphah International University, [email protected]

Lahore,Pakistan. Lahore,Pakistan

[email protected] [email protected],pk

Imran Ahmed#4

Faculty of Computing

Riphah International University,

Lahore, Pakistan

[email protected]

Abstract— The FA is the easiest machine to recognize patterns.

A finite-state machine is a model used to represent and control

execution flow. A finite-state machine, or FSM for short, is a

model of computation based on a hypothetical machine made

of one or more states. FSMs are commonly used to organize

and represent an execution flow, which is useful to implement

in games. We propose a model of Game Designing in this

paper by using finite automata. Applications of theory of

automata are very imperative now days many peoples

implement the concepts of Automata theory in countless areas.

Computational theory contains numerous tools to solve the

various complex issues easily. For example, in text search from

a given paragraph according to the given keywords, Lexical

analysis which produce tokens of given statement, in image

recognition, DNA computing, Ticket vending machine, Pattern

matching, Games designing and communication protocol. But

in designing of games it remains unusual. This paper has

simple theoretical design of a game Jungle survival using

abstract machine model Finite state automata (FA). [1] FA

clearly show the whole functionality of complete game.

Keywords— Game theory, Finite automata, Application of

automata Theory, FA Implementations, Theoretical Game

Design.

I-Introduction

Computational theory is a combination of three theories 1.

Automata theory which deals with theoretical models that

are abstract machines 1. Turning Machine (TM), 2. Linear

Bounded Automata (LBA), 3. Pushdown Automata (PDA)

and 4. Finite Automata (FA). FA is a simplest abstract

machine in theory of automata. 2. Computability and Logic

theory which deals with the limitations of these models 3.

Complexity Theory deals with what cost are required to use

these models [2]. FA contains five tuples (Q, Σ, δ, q0, F), Q

is a set of states, Σ is a set of alphabets, q0 is a starting state,

δ is a transition function which shows the all transitions

from starting state to final state which is an acceptance state

and usually denoted by F. Here is a very smallest

application of FA which is switch that is use by the different

peoples for different purposes but it has only two states one

is “ON” and other is “OFF”. Figure 1 shows a simple Finite

state automata which is at “OFF” state In the start when it

take an input then it goes to the final state which is “ON”

state and input here we use 1 when going off to on and 0

when going on to off state.. At “OFF” state get 1 as an input

it will become ON. At “ON” state get 0 as an input it will

become OFF.

Fig.1. Finite automata for switch.

In this paper we make an effort to design a game Jungle

survival with a tool of theory of automata we will use Finite

state automata to represent the all states of game and how a

man moves from one state to other state. Jungle survival

game have two levels and each level have some tasks. He

must perform previous tasks after completion of all tasks