Menu

Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time.

Tools

Danicic, Sebastian; Harman, M.; Hierons, R. and Laurence, M.. 2007. Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time. Theoretical Computer Science, 373(1-2), pp. 1-18. ISSN 03043975 [Article]

No full text available

Item Type:

Article

Identification Number (DOI):

https://doi.org/10.1016/j.tcs.2006.10.001

Departments, Centres and Research Units:

Computing

Dates:

DateEvent
March 2007Published

Item ID:

978

Date Deposited:

12 Mar 2009 15:41

Last Modified:

13 Jun 2016 12:33

Peer Reviewed:

Yes, this version has been peer-reviewed.

URI:

https://research.gold.ac.uk/id/eprint/978

Edit Record Edit Record (login required)