Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.233, Iss.1, 2000-02, pp. : 75-90
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
Pushdown timed automata: a binary reachability characterization and safety verification
By Dang Z.
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :
Access to resources
Recommend
Ergodic characterization of linear cellular automata over Z m
By Sato T.
Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. :
By Carton O.
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :
Mathematics in Computer Science, Vol. 1, Iss. 4, 2008-06 ,pp. :