The paper describes an algorithm to compute the largest compositionally-progressive solution of synchronous language equations.

A new algorithm for the largest compositionally progressive solution of synchronous language equations

VILLA, Tiziano;
2007-01-01

Abstract

The paper describes an algorithm to compute the largest compositionally-progressive solution of synchronous language equations.
2007
synchronous language equations, compositionally-progressive solutions, largest solution
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11562/318522
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact