Enlaces: |
![](http://science-h.com/sh/assets/temas/umad/img/tema/globe.png)
This dissertation formalizes a comprehensive approach based on compiler technology [3-5] to simulate some basic forms of automata viz., finite accepters, finite transducers, pushdown accepters and Turing machines. These basic forms of automata are known for their simplicity and generality,…
|