Author： Lisovik L. Koval’ D.
Publisher： Springer Publishing Company
ISSN： 1060-0396
Source： Cybernetics and Systems Analysis, Vol.40, Iss.6, 2004-11, pp. : 939-942
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
Equivalence of deterministic pushdown automata revisited
By Meitus V.
Cybernetics and Systems Analysis, Vol. 43, Iss. 2, 2007-03 ,pp. :
Access to resources
Recommend
SIMULTANEOUSLY ONE-TURN TWO-PUSHDOWN AUTOMATA
By MEDUNA A.
International Journal of Computer Mathematics, Vol. 80, Iss. 6, 2003-06 ,pp. :
By Beek M.H.T.
International Journal of Computer Mathematics, Vol. 81, Iss. 2, 2004-02 ,pp. :
ON THE SPACE COMPLEXITY OF TURN BOUNDED PUSHDOWN AUTOMATA
By MORIYA E.
International Journal of Computer Mathematics, Vol. 80, Iss. 3, 2003-01 ,pp. :
Pushdown Tree Automata, Algebraic Tree Systems, and Algebraic Tree Series
By Kuich W.
Information and Computation, Vol. 165, Iss. 1, 2001-02 ,pp. :