<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0121-750X</journal-id>
<journal-title><![CDATA[Ingeniería]]></journal-title>
<abbrev-journal-title><![CDATA[ing.]]></abbrev-journal-title>
<issn>0121-750X</issn>
<publisher>
<publisher-name><![CDATA[Universidad Distrital Francisco José de Caldas]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0121-750X2023000300206</article-id>
<article-id pub-id-type="doi">10.14483/23448393.20626</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Application of Regular Grammar in the Syntactic Analysis of Email Addresses]]></article-title>
<article-title xml:lang="es"><![CDATA[Aplicacion de gramática regular en el análisis sintáctico de direcciones de correo electrónico]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Fandino-Mesa]]></surname>
<given-names><![CDATA[Cristian Alejandro]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Suarez-Baron]]></surname>
<given-names><![CDATA[Marco Javier]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Jaramillo-Acevedo]]></surname>
<given-names><![CDATA[Cesar Augusto]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Pedagogica y Tecnologica de Colombia  ]]></institution>
<addr-line><![CDATA[Sogamoso ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Pedagogica y Tecnologica de Colombia  ]]></institution>
<addr-line><![CDATA[Sogamoso ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Tecnologica de Pereira  ]]></institution>
<addr-line><![CDATA[Pereira ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2023</year>
</pub-date>
<volume>28</volume>
<numero>3</numero>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0121-750X2023000300206&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0121-750X2023000300206&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0121-750X2023000300206&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract  Context:  This article proposes the use of regular grammar as a strategy to validate the textual structures of emails. It focuses on the RFC 5321 standard and its syntax, formalizing regular grammars to apply production rules with the aim of validating the syntactic context of each structure of an email address.  Method:  This article presents a literature review and the development of an email validation model. Related texts focus on the Internet Protocol, along with building automata that apply IPV4 protocol. There are three phases: the development of the model from syntax and regular grammar rules and its construction and application.  Results:  The result is a functional application that validates email addresses based on regular grammars and existing regulations. When running efficiency tests, our application obtained a higher email validation margin in comparison with JFLAP. The library can work as a great analyzer of grammatical or lexical structures.  Conclusions:  The email validation tool based on GR regular grammars contributes to the practical use of specialized algorithms in the field of computer science, since it is possible to apply it to the recognition of search patterns such as the analysis of lexical structures (e.g., NITs, alphanumeric codes, and valid URLs).]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen  Contexto:  En este articulo se propone el uso de la gramatica regular como estrategia para validar las estructuras textuales de los correos electronicos. El estudio se enfoca en el estandar RFC 5321 y su sintaxis, formalizando gramaticas regulares para aplicar reglas de produccion en aras de validar el contexto sintactico de cada estructura de una direccion de correo electronicos.  Metodo:  Este articulo presenta una revision de la literatura y el desarrollo de un modelo para la validacion de correos electronicos. Los textos relacionados se enfocan en el Protocolo de Internet junto con la construccion de automatas que utilizan direccionamiento IPV4. El estudio tiene tres fases: el desarrollo del modelo a partir de la sintaxis y reglas gramaticales regulares y la construccion y aplicacion del mismo.  Resultados:  El resultado es una aplicacion funcional que valida direcciones de correo electronico con base en gramaticas regulares y la reglamentacion existente. Al ejecutar pruebas de eficiencia, nuestra aplicacion obtuvo un margen de validacion de correos mayor en comparacion con JFLAP. La librería puede funcionar como un gran analizador de estructuras gramaticales o léxicas.  Conclusiones:  La herramienta de validacion de correos electronicos basada en gramaticas regulares GR contribuye al uso practico de algoritmos especializados en la rama de la computacion, dado que es posible aplicarla en el reconocimiento de patrones de busqueda como el analisis de estructuras léxicas (e.g., NITs, codigos alfanumericos, y URL validas).]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[email validation]]></kwd>
<kwd lng="en"><![CDATA[formal grammar]]></kwd>
<kwd lng="en"><![CDATA[regular expressions]]></kwd>
<kwd lng="es"><![CDATA[validacion de correos electronicos]]></kwd>
<kwd lng="es"><![CDATA[gramatica formal]]></kwd>
<kwd lng="es"><![CDATA[expresiones regulares]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>[1]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dokter]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Gadducci]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Lion]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Santini]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Soft constraint automata with memory]]></article-title>
<source><![CDATA[J. Logical Alg. Meth. Programm]]></source>
<year>2021</year>
<volume>118</volume>
<numero>art. 100615</numero>
<issue>art. 100615</issue>
</nlm-citation>
</ref>
<ref id="B2">
<label>[2]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yamakami]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Computing and Combinatorics]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[C. Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Hon]]></surname>
<given-names><![CDATA[W. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Hung]]></surname>
<given-names><![CDATA[L. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[C. W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Between SC and LOGDCFL: Families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-k storage automata]]></source>
<year>2021</year>
<page-range>164-75</page-range><publisher-loc><![CDATA[Berlin, Germany ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>[3]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shuang]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Tan]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Cai]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Sun]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Natural language modeling with syntactic structure dependency]]></article-title>
<source><![CDATA[IJ Math. Sci. Comp]]></source>
<year>2020</year>
<volume>523</volume>
<page-range>220-33</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>[4]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schwenk]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Guide to internet Cryptography, Cham]]></source>
<year>2022</year>
<publisher-loc><![CDATA[Germany ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>[5]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chandra]]></surname>
<given-names><![CDATA[P. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Sravan]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Chakravarthy]]></surname>
<given-names><![CDATA[M. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new approach to the design of a finite automaton that accepts class of IPV4 addresses]]></article-title>
<source><![CDATA[IJ Math. Sci. Comp]]></source>
<year>2019</year>
<volume>5</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>65-79</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>[6]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Paxson]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Composition kills: A case study of email sender authentication]]></article-title>
<source><![CDATA[29th USENIX Security Symposium]]></source>
<year>2020</year>
<page-range>2183-99</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>[7]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vázquez]]></surname>
<given-names><![CDATA[E. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Saiz]]></surname>
<given-names><![CDATA[T. G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to the theory of automata, grammars and languages]]></source>
<year>2022</year>
<publisher-loc><![CDATA[Madrid, Spain ]]></publisher-loc>
<publisher-name><![CDATA[Editorial Universitaria Ramón Areces]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>[8]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sharma]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Soft Computing for Problem Solving]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Thakur]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Agnihotri]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Rajpurohit]]></surname>
<given-names><![CDATA[B. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Pant]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Deep]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Nagar]]></surname>
<given-names><![CDATA[A. K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Imbalanced learning of regular grammar for DFA extraction from LSTM architecture]]></source>
<year>2023</year>
<page-range>85-95</page-range><publisher-loc><![CDATA[Berlin, Germany ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<label>[9]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Novo-Lourés]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ruano-Ordás]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Pavón]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Laza]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Gómez-Meire]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Méndez]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Enhancing representation in the context of multiple-channel spam filtering]]></article-title>
<source><![CDATA[Inf. Processing Management]]></source>
<year>2022</year>
<volume>59</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B10">
<label>[10]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Howser]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computer networks and the Internet. A hands-on approach]]></source>
<year>2020</year>
<publisher-loc><![CDATA[Berlin, Germany ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>[11]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tschabitscher]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[LifeWire]]></source>
<year>2021</year>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
