The power of writing, a pebble hierarchy and a narrative for the teaching of Automata Theory
In this work we study pebble automata. Those automata constitute an infinite hierarchy of discrete models of computation. The hierarchy begins at the level of finite state automata (0-pebble automata) and approaches the model of onetape Turing machines. Thus, it can be argued that it is a complete h...
Guardado en:
| Autores principales: | Mejía, Carolina, Montoya, J. Andrés, Nolasco, Christian |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2017
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/65162 |
| Aporte de: |
Ejemplares similares
-
Normality and automata
por: Becher, V., et al. -
Normality and automata
por: Becher, Verónica Andrea, et al.
Publicado: (2015) -
Introduction to the theory of finite automata
por: Kobrinskii, N. E.
Publicado: (1965) -
Theory and applications of cellular automata : including selected papers, 1983-1986 /
Publicado: (1986) -
Classically time-controlled quantum automata
por: Díaz-Caro, A., et al.