![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Beek M.H.T.
Publisher: Taylor & Francis Ltd
ISSN: 0020-7160
Source: International Journal of Computer Mathematics, Vol.81, Iss.2, 2004-02, pp. : 141-156
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)
Equivalence of deterministic pushdown automata revisited
By Meitus V.
Cybernetics and Systems Analysis, Vol. 43, Iss. 2, 2007-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
SIMULTANEOUSLY ONE-TURN TWO-PUSHDOWN AUTOMATA
By MEDUNA A.
International Journal of Computer Mathematics, Vol. 80, Iss. 6, 2003-06 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
ON THE SPACE COMPLEXITY OF TURN BOUNDED PUSHDOWN AUTOMATA
By MORIYA E.
International Journal of Computer Mathematics, Vol. 80, Iss. 3, 2003-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Pushdown Tree Automata, Algebraic Tree Systems, and Algebraic Tree Series
By Kuich W.
Information and Computation, Vol. 165, Iss. 1, 2001-02 ,pp. :