Subir material

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

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2013-10-03T14:18:43Z
dc.date.available 2013-10-03T14:18:43Z
dc.date.issued 2013-10
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/29808
dc.description.abstract This dissertation formalizes a comprehensive approach based on compiler technology 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, hence widely studied and used in research. es
dc.format.extent 103-104 es
dc.language en es
dc.subject Automata (e.g., finite, push-down, resource-bounded) es
dc.subject Concept learning es
dc.title A compiler technology based approach to simulation of basic forms of automata en
dc.type Articulo es
sedici.identifier.uri http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Oct13-TO1.pdf es
sedici.identifier.issn 1666-6038 es
sedici.creator.person Chakraborty, Pinaki es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Facultad de Informática es
sedici.subtype Revision es
sedici.rights.license Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc/3.0/
sedici.description.peerReview peer-review es
sedici.relation.journalTitle Journal of Computer Science & Technology es
sedici.relation.journalVolumeAndIssue vol. 13, no. 2 es


Descargar archivos

Thumbnail
Documento completo
Descargar archivo (467.7Kb) - PDF
Icon
Enlace externo

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

Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)