Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.166, Iss.1, 1996-10, pp. : 63-81
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
MSO logics for weighted timed automata
By Quaas Karin
Formal Methods in System Design, Vol. 38, Iss. 3, 2011-06 ,pp. :
Access to resources
Recommend
Guarded fixed point logics and the monadic theory of countable trees
By Gradel E.
Theoretical Computer Science, Vol. 288, Iss. 1, 2002-10 ,pp. :
Finite variability interpretation of monadic logic of order
Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. :
By BASU SUMITA
Cybernetics and Systems, Vol. 36, Iss. 2, 2005-03 ,pp. :
Finite automata on timed -trees
Theoretical Computer Science, Vol. 293, Iss. 3, 2003-02 ,pp. :