Membership Problem with Adjacency Matrix

Authors

  • Yolanda Moyao Martinez Benemérita Universidad Autónoma de Puebla, Facultad de Ciencias de la Computación
  • Darnes Vilariño Ayala Benemérita Universidad Autónoma de Puebla, Facultad de Ciencias de la Computación
  • Jose de Jesus Lavalle Martínez
  • Carlos Guillen Galban

DOI:

https://doi.org/10.13053/cys-25-3-4023

Keywords:

Membership problem, hypergraph, adjacency matrix

Abstract

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

Published

2021-08-18

Issue

Section

Articles