Author： Salomaa K. Yu S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.276, Iss.1, 2002-04, pp. : 245-259
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Decidability results for Watson-Crick D0L systems with nonregular triggers
By Honkala J.
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :
Access to resources
Recommend
Decidability of behavioural equivalence in unary PCF
Theoretical Computer Science, Vol. 216, Iss. 1, 1999-03 ,pp. :
A new bound for the D0L sequence equivalence problem
By Honkala Juha
Acta Informatica, Vol. 43, Iss. 6, 2007-01 ,pp. :
Decidability of equivalence for deterministic synchronized tree automata
By Salomaa K.
Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. :
Decidability of bisimulation equivalence for normed pushdown processes
By Stirling C.
Theoretical Computer Science, Vol. 195, Iss. 2, 1998-03 ,pp. :