Theoretical results for optimal PLA folding

• Autores: M.G. Hadjinicolaou, G. Musgrave
• Localización: Mini and Microcomputers and their applications / Emilio Luque Fadón (ed. lit.), 1988, págs. 37-40
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • In this paper we propose a new algorithm for optimal PLA folding based on the coumn/row disjoint graph. The algorithm is of the Epth-First Search (DFS) type which finds a maximal set of ordered folding pairs using the disjoint graph generated from the personality matrix of the PLA. The DFS algorithm does not require to check for cycles within the graph since the ordered folding pairs are determined in an ascendant-descendant relationship from the graph.