International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 54 | Number 1 | Year 2017 | Article Id. IJCTT-V54P106 | DOI : https://doi.org/10.14445/22312803/IJCTT-V54P106

A Recursive Code Generating Algorithm for Automata Control

Monday O. Eze, Shade Kuyoro

Citation :

Monday O. Eze, Shade Kuyoro, "A Recursive Code Generating Algorithm for Automata Control," International Journal of Computer Trends and Technology (IJCTT), vol. 54, no. 1, pp. 24-29, 2017. Crossref, https://doi.org/10.14445/22312803/IJCTT-V54P106

Abstract

Automata Theory involves the evolution, study and application of abstract machines to solve computational problems. A number of research domains such as Compiler Construction, Robotics, Logic Programming, and Linguistic Computing make extensive use of automata theory. A key component of the 5-tuple that constitute a finite automata is the set of transition functions, which gives rise to an evolutionary design tool called the transition diagram. A transition diagram models the movement of a machine from one state or location to another. Usually, in cases where the number of states covered by the transiting object is minimal, generating a transition diagram may follow sequentially, from entry till acceptance state through separate invocations. However, as the number of states grow from tens to hundreds or thousands, the need for a computational solution becomes very apparent. Suppose the movement of an automata driven refuse collection robot which covers hundreds of locations per day is modelled using a transition diagram, such that each movement represents a transition from one state to another. Traditionally, this would require an invocation of a separate transition function for every singular transition, giving rise to a number of sequential system calls equivalent to the total number of separate transitions. Such a method could be very tedious, time consuming, and error-prone. The aim of this research is to evolve an algorithm that generates a single line of recursive code that drives an unlimited number of transition moves at once, instead of maintaining separate invocations. A new algorithmic technique termed quantum code blocking was also evolved to test the output, to ensure its correctness.

Keywords

Automata Theory, Abstract Machines, Transition Diagram, Recursive Code Generation, Mobile Robots, Algorithms.

References

[1] J. Starzyk (2011). "A Computational Model of Machine Consciousness", International Journal of Machine Consciousness, Vol. 3, Issue 02, pp255-281
[2] P. Linz. (2012). "An Introduction to Formal Languages and Automata", 5th Ed, Jones & Bartlett Learning, Ontario Canada.
[3] B. Melnikov (2002). "A New Algorithm of Constructing the Basis Finite Automaton", Informatica, Vol. 13, No. 3, pp299–310.
[4] M. John (2011). "Introduction to Languages and the Theory of Computation", 4th Ed, McGraw-Hill, New York.
[5] A. James (2006). "Automata Theory with Modern Applications", Cambridge University Press, Cambridge, UK. [6] A. Maheshwari & M. Smid (2014). ?Introduction to Theory of Computation?, School of Computer Science, Carleton University, Ottawa, Canada.
[7] A. Alrehily, R. Fallatah and V. Thayananthan (2015). "Design of Vending Machine using Finite State Machine and Visual Automata Simulator", International Journal of Computer Appl., Vol. 115, No. 18,pp37-42 [8] D. Harel & Y. Koren (2002). "A Fast Multi-Scale Method for Drawing Large Graphs,Journal of Graph Algorithms and Applications Vol. 6, No. 3, pp. 179-202.
[9] A. Clark & F. Thollard (2004). "PAC-learnability of Probabilistic Deterministic Finite State Automata", Journal of Machine Learning Research 5, pp473-497.
[10] S. Singh &S. Sukhvinder (2010). "Artificial Intelligence", International Journal of Computer Applications, Volume 6– No.6, pp 21-23.
[11] M. van Zaanen & C. de la Higuera (2009). "Grammatical Inference and Computational Linguistics", Proceedings of the EACL 2009 Workshop on Computational Linguistic Aspects of Grammatical Inference, Athens, Greece, pp1-4.
[12] S. Aastha, S. Sinha, and A. Priyadarshi (2013). "Compiler Construction", International Journal of Scientific and Research Publications, Volume 3, Issue 4,pp1-6.
[13] P. Sapaty (2015). "Military Robotics: Latest Trends and Spatial Grasp Solutions", Int. Journal of Advanced Research in Artificial Intelligence, Vol. 4, No.4, pp1-10.
[14] A. F. Abbas (2014). ?Comparison Between Programming Languages Prolog , C ++ , Pascal", Mathematical Theory and Modeling", Vol.4, No.14,pp27-40.
[15] S. Nurmaini, and A. Primanita (2012). "Modeling of Mobile Robot System with Control Strategy Based on Type-2 Fuzzy Logic", International Journal of Information and Communication Technology Research, Volume 2 No. 3, pp235-242.
[16] R. M. Varkey and J. M. Sunny (2014). "Design and Implementation of Multi Select Smart Vending Machine", International Journal of Computer Networks and Wireless Communications, Vol.4, No1, pp42-45.
[17] H. Li (2016). "Binary Tree‘s Recursion Traversal Algorithm and Its Improvement", Journal of Computer and Communications, Vol 4, pp42-47.
[18] J. Iovine(2004). "PIC Robotics A Beginner‘s Guide to Robotics Projects Using the PICmicro", McGraw-Hill, New York.
[19] K. Rosen (2007). ?Discrete Mathematics and Its Applications?, 7th Ed, McGraw-Hill, NewYork, NY.
[20] S. Hamed (2007). "Automatic Generation of Generalised Event Sequence Diagrams for Guiding Simulation-Based Dynamic Probalitlistic Risk Assessment of ComplexSystems", A PhD Dissertation submitted to the Faculty of the Graduate School of the University of Maryland, USA,
[21] R. Swain1, P. Kumar, and D. Prasad (2012). "Automatic Test case Generation From UML State Chart Diagram", International Journal of Computer Applications, Vol. 42, No. 7,pp26-36.
[22] M. Dhar (2013). Cardinality of Fuzzy Sets: An Overview?, International Journal of Energy, Information and Communications, Vol. 4, Issue 1, February, pp15-22