Author： MEDUNA A.
Publisher： Taylor & Francis Ltd
ISSN： 0020-7160
Source： International Journal of Computer Mathematics, Vol.80, Iss.6, 2003-06, pp. : 679-687
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
ON THE SPACE COMPLEXITY OF TURN BOUNDED PUSHDOWN AUTOMATA
By MORIYA E.
International Journal of Computer Mathematics, Vol. 80, Iss. 3, 2003-01 ,pp. :
Access to resources
Recommend
By Beek M.H.T.
International Journal of Computer Mathematics, Vol. 81, Iss. 2, 2004-02 ,pp. :
Equivalence of deterministic pushdown automata revisited
By Meitus V.
Cybernetics and Systems Analysis, Vol. 43, Iss. 2, 2007-03 ,pp. :
Pushdown Tree Automata, Algebraic Tree Systems, and Algebraic Tree Series
By Kuich W.
Information and Computation, Vol. 165, Iss. 1, 2001-02 ,pp. :