Introduction

The aim of the application is to provide a tool for simulating automata: finite state automata, FA, and push down automata, PDA.

Automata play an essential role in computer science.

they serve as a simple model of an actual computer
they can be applied to the design of several common algorithms and programs. For example the lexical analysis of a compiler can be based on the simulation of a finite automaton, or the problem of finding occurence of a string in a text.

An automaton acts as a language recognizer: it receives an input string and it delivers an indication whether the input is considered acceptable.

The program AUTOMATA also provides grammar simulation. Grammars are formalisms used to specify languages. A grammar can be viewed as a language generator, because it establishes the rules that we can use to form correct sentences in the language.

Previous Section
Next Section

Back to Index