![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Dai J.J. Lathrop J.I. Lutz J.H. Mayordomo E.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.310, Iss.1, 2004-01, pp. : 1-33
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)
By BASU SUMITA
Cybernetics and Systems, Vol. 36, Iss. 2, 2005-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Deciding sequentiability of finite-state transducers by finite-state pattern-matching
By Gaal T.
Theoretical Computer Science, Vol. 313, Iss. 1, 2004-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Hardness of equivalence checking for composed finite-state systems
By Sawa Zdeněk
Acta Informatica, Vol. 46, Iss. 3, 2009-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Finite-state analysis of two contract signing protocols
By Shmatikov
Theoretical Computer Science, Vol. 283, Iss. 2, 2002-06 ,pp. :