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

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 st...

Descripción completa

Detalles Bibliográficos
Autor principal: Chakraborty, Pinaki
Formato: Articulo Revision
Lenguaje:Inglés
Publicado: 2013
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/29808
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Oct13-TO1.pdf
Aporte de:
id I19-R120-10915-29808
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Automata (e.g., finite, push-down, resource-bounded)
Concept learning
spellingShingle Ciencias Informáticas
Automata (e.g., finite, push-down, resource-bounded)
Concept learning
Chakraborty, Pinaki
A compiler technology based approach to simulation of basic forms of automata
topic_facet Ciencias Informáticas
Automata (e.g., finite, push-down, resource-bounded)
Concept learning
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.
format Articulo
Revision
author Chakraborty, Pinaki
author_facet Chakraborty, Pinaki
author_sort Chakraborty, Pinaki
title A compiler technology based approach to simulation of basic forms of automata
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 compiler technology based approach to simulation of basic forms of automata
publishDate 2013
url http://sedici.unlp.edu.ar/handle/10915/29808
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Oct13-TO1.pdf
work_keys_str_mv AT chakrabortypinaki acompilertechnologybasedapproachtosimulationofbasicformsofautomata
AT chakrabortypinaki compilertechnologybasedapproachtosimulationofbasicformsofautomata
bdutipo_str Repositorios
_version_ 1764820468242579460