![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Salomaa K.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.167, Iss.1, 1996-10, pp. : 171-192
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Decidability of behavioural equivalence in unary PCF
Theoretical Computer Science, Vol. 216, Iss. 1, 1999-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Deterministic generalized automata
By Giammarresi D. Montalbano R.
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Number-conserving cellular automata I: decidability
By Durand B. Formenti E. Roka Z.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Program schemata vs. automata for decidability of program logics
By Shilov N.V.
Theoretical Computer Science, Vol. 175, Iss. 1, 1997-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Universality and decidability of number-conserving cellular automata
By Moreira A.
Theoretical Computer Science, Vol. 292, Iss. 3, 2003-01 ,pp. :