A compiler technology based approach to simulation of basic forms of automata

Autores
Chakraborty, Pinaki
Año de publicación
2013
Idioma
inglés
Tipo de recurso
reseña artículo
Estado
versión publicada
Descripción
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.
Facultad de Informática
Materia
Ciencias Informáticas
Automata (e.g., finite, push-down, resource-bounded)
Concept learning
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc/3.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/29808
Acceder
id SEDICI_8b208aecc4f327ad7ad4e9fa23524bd5
oai_identifier_str oai:sedici.unlp.edu.ar:10915/29808
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A compiler technology based approach to simulation of basic forms of automataChakraborty, PinakiCiencias InformáticasAutomata (e.g., finite, push-down, resource-bounded)Concept learningThis 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.Facultad de Informática2013-10info:eu-repo/semantics/reviewinfo:eu-repo/semantics/publishedVersionRevisionhttp://purl.org/coar/resource_type/c_dcae04bcinfo:ar-repo/semantics/resenaArticuloapplication/pdf103-104http://sedici.unlp.edu.ar/handle/10915/29808enginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Oct13-TO1.pdfinfo:eu-repo/semantics/altIdentifier/issn/1666-6038info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc/3.0/Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2026-06-23T10:20:17Zoai:sedici.unlp.edu.ar:10915/29808Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292026-06-23 10:20:17.369SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A compiler technology based approach to simulation of basic forms of automata
title A compiler technology based approach to simulation of basic forms of automata
spellingShingle A compiler technology based approach to simulation of basic forms of automata
Chakraborty, Pinaki
Ciencias Informáticas
Automata (e.g., finite, push-down, resource-bounded)
Concept learning
title_short A compiler technology based approach to simulation of basic forms of automata
title_full A compiler technology based approach to simulation of basic forms of automata
title_fullStr A compiler technology based approach to simulation of basic forms of automata
title_full_unstemmed A compiler technology based approach to simulation of basic forms of automata
title_sort A compiler technology based approach to simulation of basic forms of automata
dc.creator.none.fl_str_mv Chakraborty, Pinaki
author Chakraborty, Pinaki
author_facet Chakraborty, Pinaki
author_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Automata (e.g., finite, push-down, resource-bounded)
Concept learning
topic Ciencias Informáticas
Automata (e.g., finite, push-down, resource-bounded)
Concept learning
dc.description.none.fl_txt_mv 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.
Facultad de Informática
description 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.
publishDate 2013
dc.date.none.fl_str_mv 2013-10
dc.type.none.fl_str_mv info:eu-repo/semantics/review
info:eu-repo/semantics/publishedVersion
Revision
http://purl.org/coar/resource_type/c_dcae04bc
info:ar-repo/semantics/resenaArticulo
format review
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/29808
url http://sedici.unlp.edu.ar/handle/10915/29808
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Oct13-TO1.pdf
info:eu-repo/semantics/altIdentifier/issn/1666-6038
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc/3.0/
Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc/3.0/
Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
dc.format.none.fl_str_mv application/pdf
103-104
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1868981711864332288
score 13.265058

Publicaciones similares