![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: DasGupta
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.262, Iss.1, 2001-07, pp. : 161-189
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)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/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)
A Polynomial-Time Parsing Algorithm for K -Depth Languages
Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. :