Equational properties of iteration in algebraically complete categories

By Esik Z.   Labella A.  

Theoretical Computer Science, Vol. 195, Iss. 1, 1998-03 ,pp. : 61-89

Elsevier

Access to resources Recommend Favorite

A complete axiomatization of timed bisimulation for a class of timed regular behaviours

By Aceto L.   Jeffrey A.  

Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. : 251-268

Elsevier

Access to resources Recommend Favorite

A Complete Mechanization of Correctness of a String-Preprocessing Algorithm

By Besta Milos   Stomp Frank  

Formal Methods in System Design, Vol. 27, Iss. 1-2, 2005-09 ,pp. : 5-27

Springer Publishing Company

Access to resources Recommend Favorite

Topology of strings: Median string is NP-complete

By de la Higuera C.   Casacuberta F.  

Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. : 39-48

Elsevier

Access to resources Recommend Favorite

An axiomatization of graphs

By Bozapalidis Symeon   Kalampakas Antonios  

Acta Informatica, Vol. 41, Iss. 1, 2004-11 ,pp. : 19-61

Springer Publishing Company

Access to resources Recommend Favorite