Abstract
It is shown that decidability of equivalence between an FDOL language and a DOL language implies that of equivalence between a OL language and a DOL language. Another consequence of the first decidability is the decidability of ‘DOLness’ of a OL language.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
