The DOL omega-equivalence problem




Honkala J

PublisherWORLD SCIENTIFIC PUBL CO PTE LTD

2007

International Journal of Foundations of Computer Science

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE

INT J FOUND COMPUT S

18

1

181

194

14

0129-0541

DOIhttps://doi.org/10.1142/S0129054107004620



Culik II and Harju have shown that the omega-equivalence problem is decidable for DOL systems. We give a new proof of this result.



Last updated on 2024-26-11 at 23:09