<?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>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462021000300523</article-id>
<article-id pub-id-type="doi">10.13053/cys-25-3-4023</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Problema de membresía con matriz de adyacencia]]></article-title>
<article-title xml:lang="en"><![CDATA[Membership Problem with Adjacency Matrix]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Moyao Martínez]]></surname>
<given-names><![CDATA[Yolanda]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Lavalle Martínez]]></surname>
<given-names><![CDATA[José de Jesús]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Guillén Galbán]]></surname>
<given-names><![CDATA[Carlos]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Vilariño Ayala]]></surname>
<given-names><![CDATA[Darnes]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Benemérita Universidad Autónoma de Puebla Facultad de Ciencias de la Computación ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2021</year>
</pub-date>
<volume>25</volume>
<numero>3</numero>
<fpage>523</fpage>
<lpage>535</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462021000300523&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462021000300523&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462021000300523&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen: En este artículo se propone un algoritmo, para resolver el problema de membresía en Gramáticas de Reemplazo de Hiperaristas (HRG). Given a hypergraph H with labeled nodes and hyperedges, dirigidas y enraizadas, el problema consiste en determinar si H &#8712; L(G), donde G &#8712; HRG, es decir si H está en el lenguaje generado por G, para esto el análisis se lleva a cabo directamente en la Matriz de Adyacencias del hipergrafo H. Además, para el algoritmo propuesto se presenta la demostración de que es correcto.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Resumen: In this article, proposed a algorithm to solve the membership problem in Hyperedge Replacement Grammars (HRG). Given a hypergraph H with labeled nodes rooted and directed hyperedges, the problem consists in determining if H &#8712; L(G), where G is in HRG, this is to say, if H is in the language generated by G, for this the analysis is done directly in the Adjacency Matrix of the hypergraph H. For the algorithm proposed, also presents the proof of its correctness.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Problema de membresía]]></kwd>
<kwd lng="es"><![CDATA[hipergrafo]]></kwd>
<kwd lng="es"><![CDATA[matriz de adyacencias]]></kwd>
<kwd lng="en"><![CDATA[Membership problem]]></kwd>
<kwd lng="en"><![CDATA[hypergraph]]></kwd>
<kwd lng="en"><![CDATA[adjacency matrix]]></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[Aalbersberg]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Rozenberg]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Ehrenfeucht]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the membership problem for regular dnlc grammars]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>1986</year>
<volume>13</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>79-85</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aguiñaga]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Chiang]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Weninger]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Learning hyperedge replacement grammars for graph generation]]></article-title>
<source><![CDATA[CoRR]]></source>
<year>2018</year>
<volume>abs</volume>
<page-range>1802.08068</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chiang]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Andreas]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Bauer]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Hermann]]></surname>
<given-names><![CDATA[K. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Jones]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Knight]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Parsing graphs with hyperedge replacement grammars]]></source>
<year>2013</year>
<conf-name><![CDATA[ 51st Annual Meeting of the Association for Computational Linguistics]]></conf-name>
<conf-loc> </conf-loc>
<page-range>924-32</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Courcelle]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The monadic second-order logic of graphs V: on closing the gap between definability and recognizability]]></article-title>
<source><![CDATA[Theor. Comput. Sci.]]></source>
<year>1991</year>
<volume>80</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>153-202</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Drewes]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Kreowski]]></surname>
<given-names><![CDATA[H.-J.]]></given-names>
</name>
<name>
<surname><![CDATA[Habel]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hyperedge Replacement Graph Grammars]]></article-title>
<source><![CDATA[Handbook of graph grammars and computing by graph transformation]]></source>
<year>1997</year>
<page-range>95-162</page-range><publisher-loc><![CDATA[River Edge, NJ, USA ]]></publisher-loc>
<publisher-name><![CDATA[World Scientific Publishing Co., Inc.,]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Engelfriet]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Context-free Graph Grammars]]></article-title>
<source><![CDATA[Handbook of formal languages]]></source>
<year>1997</year>
<volume>3</volume>
<page-range>125-213</page-range><publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag New York, Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gallo]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Scutellà]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Directed hypergraphs as a modelling paradigm]]></article-title>
<source><![CDATA[Decisions in Economics and Finance]]></source>
<year>1998</year>
<volume>21</volume>
<page-range>97-123</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gilroy]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[López]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Maneth]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Parsing graphs with regular graph grammars]]></source>
<year>2017</year>
<conf-name><![CDATA[ 6th Joint Conference on Lexical and Computational Semantics (*SEM 2017)]]></conf-name>
<conf-loc>Vancouver, Canada </conf-loc>
<page-range>199-208</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gottlob]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Grohe]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Musliu]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Samer]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Scarcello]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hypertree decompositions: Structure, algorithms, and applications]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Kratsch]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Graph-Theoretic Concepts in Computer Science]]></source>
<year>2005</year>
<page-range>1-15</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Groschwitz]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Koller]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Teichmann]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Graph parsing with s-graph grammars]]></source>
<year>2015</year>
<conf-name><![CDATA[ 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, ACL 2015]]></conf-name>
<conf-date>July 26-31, 2015</conf-date>
<conf-loc>Beijing, China </conf-loc>
<page-range>1481-90</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Habel]]></surname>
</name>
</person-group>
<source><![CDATA[Hyperedge Replacement: Grammars and Languages]]></source>
<year>1991</year>
<edition>1</edition>
<publisher-loc><![CDATA[United States of America ]]></publisher-loc>
<publisher-name><![CDATA[University of Bremen]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lange]]></surname>
<given-names><![CDATA[K.-J.]]></given-names>
</name>
<name>
<surname><![CDATA[Welzl]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>1987</year>
<volume>16</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>17-30</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lautemann]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The complexity of graph languages generated by hyperedge replacement]]></article-title>
<source><![CDATA[Acta Informatica]]></source>
<year>1990</year>
<volume>27</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>399-421</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Minas]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Hypergraphs as a uniform diagram representation model]]></source>
<year>2000</year>
<conf-name><![CDATA[ 6th International Workshop on Theory and Application of Graph Transformations, TAGT&#8217;98]]></conf-name>
<conf-loc>London, UK </conf-loc>
<page-range>281-95</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Peng]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Song]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Gildea]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[A synchronous hyperedge replacement grammar based approach for AMR parsing]]></source>
<year>2015</year>
<conf-name><![CDATA[ Nineteenth Conference on Computational Natural Language Learning]]></conf-name>
<conf-loc> </conf-loc>
<page-range>32-41</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Peuser]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[From hyperedge replacement grammars to decidable hyperedge replacement games]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Mazzara]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ober]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Salaün]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Software Technologies: Applications and Foundations - STAF 2018 Collocated Workshops]]></source>
<year>2018</year>
<volume>11176</volume>
<page-range>463-78</page-range><publisher-loc><![CDATA[Toulouse, France ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rozenberg]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of graph grammars and computing by graph transformation]]></source>
<year>1997</year>
</nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rozenberg]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Welzl]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Boundary NLC graph grammars basic definitions, normal forms, and complexity]]></article-title>
<source><![CDATA[Information and Control]]></source>
<year>1986</year>
<volume>69</volume>
<page-range>136-67</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
