Aprendizaje de gramáticas mediante sistemas evolutivos
| dc.contributor.advisor | Chavoya Aceves, Oscar | |
| dc.contributor.author | Morales Bohórquez, Lina Marcela | |
| dc.coverage.campus | UNAB Campus Bucaramanga | spa |
| dc.coverage.spatial | Bucaramanga, Santander (Colombia) | spa |
| dc.date.accessioned | 2024-09-23T21:09:07Z | |
| dc.date.available | 2024-09-23T21:09:07Z | |
| dc.date.issued | 1997 | |
| dc.degree.name | Ingeniero de Sistemas | spa |
| dc.description.abstract | Un buen número de sistemas de reconocimiento de patrones y de Inteligencia Artificial emplean gramáticas formales para la representación de conceptos. En realidad, en un sentido muy general, como consecuencia lógica de la tesis de Church, se puede afirmar que las representaciones que se usan en todos los sistemas computacionales, siendo representaciones computables, pueden ser especificadas haciendo uso del concepto de gramática de estructura de frase. Una gramática es una especificación, generalmente recursiva, de un conjunto, potencialmente infinito de secuencias, que constituyen un lenguaje formal. Las gramáticas de estructura de frase se han usado para describir los lenguajes naturales, aunque en el caso de éstos las reglas gramaticales son, más bien, convenciones generalmente aceptadas para la construcción de oraciones bien formadas que, sin embargo, admiten excepciones. En cuanto a la especificación de los lenguajes formales, las reglas gramaticales son inviolables. | spa |
| dc.description.abstractenglish | A good number of pattern recognition and Artificial Intelligence systems use formal grammars to represent concepts. In fact, in a very general sense, as a logical consequence of Church's thesis, it can be stated that the representations that are used in all computational systems, being computable representations, can be specified using the concept of phrase structure grammar. . A grammar is a specification, generally recursive, of a potentially infinite set of sequences that constitute a formal language. Phrase structure grammars have been used to describe natural languages, although in the case of natural languages the grammatical rules are, rather, generally accepted conventions for the construction of well-formed sentences that, however, allow for exceptions. Regarding the specification of formal languages, grammatical rules are inviolable. | spa |
| dc.description.degreelevel | Pregrado | spa |
| dc.description.learningmodality | Modalidad Presencial | spa |
| dc.description.tableofcontents | INTRODUCCIÓN ALINEACIÓN DE MÚLTIPLES SECUENCIAS ADAPTACIÓN DE EXPRESIONES REGULARES CONCLUSIONES REFERENCIAS BIBLIOGRÁFICAS ANEXOS | spa |
| dc.format.mimetype | application/pdf | spa |
| dc.identifier.instname | instname:Universidad Autónoma de Bucaramanga - UNAB | spa |
| dc.identifier.reponame | reponame:Repositorio Institucional UNAB | spa |
| dc.identifier.repourl | repourl:https://repository.unab.edu.co | spa |
| dc.identifier.uri | http://hdl.handle.net/20.500.12749/26711 | |
| dc.language.iso | spa | spa |
| dc.publisher.faculty | Facultad Ingeniería | spa |
| dc.publisher.grantor | Universidad Autónoma de Bucaramanga UNAB | spa |
| dc.publisher.program | Pregrado Ingeniería de Sistemas | spa |
| dc.relation.references | John E. Hopcroft, Jeffrey D. Ullman; Introduction to Automata Theory, Languages and Compuation; Addison-Wesley Pub. Co. 1979. | spa |
| dc.relation.references | LiMin Fu; Neural Networks in Computer Intelligence; McGraw-Hill 1994, | spa |
| dc.relation.references | David E. Goldberg; Genetic Algorithms in search, Optimization, and Machine Learning, Addison-Wesley Pub. Co. 1989. | spa |
| dc.relation.references | Elaine Rich, Kevin Knight; Artificial Intelligence 2nd edition; McGraw-Hill International Editions 1991. | spa |
| dc.relation.references | Branco Soucek, The Iris Group; Dynamic, Genetic, and Chaotic Programming the sixth generation; Wiley Inter-science1993. | spa |
| dc.relation.references | Pavel Goralcik; Alignement Multiples; | spa |
| dc.relation.references | Menedetter T., G. Vergnaud, and P.F. Ambros; Mapping OFfDNA Sequences Frequently Deleted In Human Neoplasms: Comparison Of Physical And Genetic Data; | spa |
| dc.relation.references | Lea McLees; Computerized Gene Detective Helps Molecular Biologists Worldwide Identify DNA Sequences Via e-mail; | spa |
| dc.relation.references | Julie Thompson, Toby Gipson; Clustal W version 1.6 March 1996; | spa |
| dc.relation.references | nge Jonassen; Patterns in biosequences; | spa |
| dc.relation.references | Manber U, Wu $.,Aproximatte pattern matching, BYTE November 1992 p.281-292 | spa |
| dc.relation.references | Brazma Alvis, Jonassen Inge, Eidhammer Ingvar, Gilbert David ; Approaches to the automatic discovery of patterns in biosequences ¡Report No 113, December 1995, Departament of Informatics, University of Bergen, Bergen, Norway. | spa |
| dc.relation.references | Jonassen Inge ; Efficient discovery of conserved patterns using a pattern graph ; Report No 118, March 1996, Departament of Informatics, University of Bergen, Bergen, Norway. | spa |
| dc.relation.references | Glenn Brookshear ; Teoría de la Computación : lenguajes formales, autómatas y complejidad, Addison-Wesley Iberoamericana, 1989; | spa |
| dc.relation.references | Koza, John R. 1992. Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: The MIT Press. | spa |
| dc.rights.accessrights | info:eu-repo/semantics/openAccess | spa |
| dc.rights.creativecommons | Atribución-NoComercial-SinDerivadas 2.5 Colombia | * |
| dc.rights.local | Abierto (Texto Completo) | spa |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.5/co/ | * |
| dc.subject.keywords | Systems engineer | spa |
| dc.subject.keywords | Technological innovations | spa |
| dc.subject.keywords | Genetic algorithms | spa |
| dc.subject.keywords | Genetic programming | spa |
| dc.subject.keywords | Multiple sequences | spa |
| dc.subject.keywords | Regular Expressions | spa |
| dc.subject.keywords | Artificial intelligence | spa |
| dc.subject.keywords | Computer programs | spa |
| dc.subject.keywords | Graph theory | spa |
| dc.subject.keywords | Genetic programming (Computer science) | spa |
| dc.subject.lemb | Ingeniería de sistemas | spa |
| dc.subject.lemb | Innovaciones tecnológicas | spa |
| dc.subject.lemb | Inteligencia artificial | spa |
| dc.subject.lemb | Programas para computador | spa |
| dc.subject.lemb | Teoría de grafos | spa |
| dc.subject.lemb | Programación genética (Computadores) | spa |
| dc.subject.proposal | Algoritmos genéticos | spa |
| dc.subject.proposal | Programación genética | spa |
| dc.subject.proposal | Múltiples secuencias | spa |
| dc.subject.proposal | Expresiones regulares | spa |
| dc.title | Aprendizaje de gramáticas mediante sistemas evolutivos | spa |
| dc.title.translated | Grammar learning through evolutionary systems | spa |
| dc.type.coar | http://purl.org/coar/resource_type/c_7a1f | |
| dc.type.coarversion | http://purl.org/coar/version/c_ab4af688f83e57aa | spa |
| dc.type.driver | info:eu-repo/semantics/bachelorThesis | |
| dc.type.hasversion | info:eu-repo/semantics/acceptedVersion | |
| dc.type.local | Trabajo de Grado | spa |
| dc.type.redcol | http://purl.org/redcol/resource_type/TP |
Archivos
Bloque original
1 - 1 de 1
Cargando...
- Nombre:
- 1997_Tesis_Lina_Morales.pdf
- Tamaño:
- 15.4 MB
- Formato:
- Adobe Portable Document Format
- Descripción:
- Tesis
Bloque de licencias
1 - 1 de 1
Cargando...
- Nombre:
- license.txt
- Tamaño:
- 829 B
- Formato:
- Item-specific license agreed upon to submission
- Descripción:
