Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2018-02-26T15:59:05Z
dc.date.available 2018-02-26T15:59:05Z
dc.date.issued 2017
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/65162
dc.description.abstract 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 hierarchy that covers, in a continuous way, all the models of automata that are important in the theory of computation. We investigate the use of this hierarchy as a narrative for the teaching of automata theory. We also investigate some fundamental questions concerning the power of pebble automata. es
dc.language en es
dc.subject pebble automata en
dc.subject finite state automata en
dc.title The power of writing, a pebble hierarchy and a narrative for the teaching of Automata Theory en
dc.type Objeto de conferencia es
sedici.creator.person Mejía, Carolina es
sedici.creator.person Montoya, J. Andrés es
sedici.creator.person Nolasco, Christian es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Sociedad Argentina de Informática e Investigación Operativa (SADIO) es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-sa/4.0/
sedici.date.exposure 2017-09
sedici.relation.event Simposio Latinoamericano de Teoría Computacional (SLTC) - JAIIO 46 (Córdoba, 2017). es
sedici.description.peerReview peer-review es


Descargar archivos

Thumbnail
Documento completo
Descargar archivo (184.8Kb) - PDF

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)