A Compiler Technology Based Approach to Simulation of Basic Forms of Automata

• Pinaki Chakraborty ^[1]
  1. [1] Jawaharlal Nehru University

     Jawaharlal Nehru University

     India

     
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 13, Nº. 2, 2013, págs. 103-104
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • An automaton is an abstract model of a computer. Various types of automata have been developed to date to model computer systems and computing processes. Theory of automata includes the study of these automata along with their properties and applications. Theory of automata is often taught, learned and researched using tools known as automata simulators [1]. Automata simulators can be used to model large and complex automata, simulate them for any input string and study their properties. The automata simulators may be classified as language based automata simulators, visualization centric automata simulators and hardware automata simulators [2]. A language based automata simulator receives the definition of an automaton in a formal language, which may be notational, assembly-like, procedural or descriptive, and simulates it using some technique for processing formal languages. A visualization centric automata simulator receives the specification of an automaton in either a tabular or a diagrammatic form and visually simulates it. A hardware automata simulator is implemented fully or partially in hardware and simulates an automaton using actual hardware manipulations.

    This study is expected to be helpful in further research on simulation of basic forms of automata and encourage the use of automata simulators in both academic and research environments. Additionally, the concepts used to implement nondeterminism in the Automata Description Language may also be used to develop nondeterministic general purpose procedural languages.