Login / Signup

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

Sebastian DanicicMark HarmanRobert M. HieronsJohn HowroydMichael R. Laurence
Published in: Theor. Comput. Sci. (2007)
Keyphrases