Complexity analysis of reactive graph grammars

dc.contributor.author	Loreto, Aline Brum	pt_BR
dc.contributor.author	Toscani, Laira Vieira	pt_BR
dc.contributor.author	Ribeiro, Leila	pt_BR
dc.date.accessioned	2023-03-22T03:24:34Z	pt_BR
dc.date.issued	2000	pt_BR
dc.identifier.issn	0103-4308	pt_BR
dc.identifier.uri	http://hdl.handle.net/10183/256164	pt_BR
dc.description.abstract	The aim of this paper is to present a way to calculate a complexity measurement of graph grammar specifications of reactive systems. The basic operation that describe the behavior of a graph grammar is a rule application. Therefore, this operation will be used to characterize the tasks to be performed within a system. The complexity measurement defined here ,vill give us the minimum numbei:· of steps that must be present in a computation that performs a desir_ed task.	en
dc.format.mimetype	application/pdf	pt_BR
dc.language.iso	eng	pt_BR
dc.relation.ispartof	Revista de Informatica Teorica e Aplicada. Porto Alegre. Vol. 7, n. 1 (set. 2000), p. 109-128.	pt_BR
dc.rights	Open Access	en
dc.subject	Gramatica : Grafos	pt_BR
dc.subject	Graph grammars	en
dc.subject	Complexidade computacional	pt_BR
dc.subject	Complexity	en
dc.subject	Sistemas reativos	pt_BR
dc.title	Complexity analysis of reactive graph grammars	pt_BR
dc.type	Artigo de periódico	pt_BR
dc.identifier.nrb	000281954	pt_BR
dc.type.origin	Nacional	pt_BR

Este item está licenciado na Creative Commons License