Servicios Personalizados
Revista
Articulo
Indicadores
- Citado por SciELO
- Accesos
Links relacionados
- Similares en SciELO
Compartir
Computación y Sistemas
versión On-line ISSN 2007-9737versión impresa ISSN 1405-5546
Resumen
MOYAO MARTINEZ, Yolanda; LAVALLE MARTINEZ, José de Jesús; GUILLEN GALBAN, Carlos y VILARINO AYALA, Darnes. Membership Problem with Adjacency Matrix. Comp. y Sist. [online]. 2021, vol.25, n.3, pp.523-535. Epub 13-Dic-2021. ISSN 2007-9737. https://doi.org/10.13053/cys-25-3-4023.
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 ∈ 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.
Palabras llave : Membership problem; hypergraph; adjacency matrix.