On the Complexity of 2-Monotone Restarting Automata

Author： Jurdziński Tomasz  

Publisher： Springer Publishing Company

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.42, Iss.4, 2008-05, pp. : 488-518

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata

By Messerschmidt Hartmut  

Theory of Computing Systems, Vol. 48, Iss. 2, 2011-02 ,pp. : 343-373

Springer Publishing Company

Access to resources Recommend Favorite

Degrees of monotone complexity

By  

The Journal of Symbolic Logic, Vol. 71, Iss. 4, 2006-12 ,pp. : 1327-1341

Cambridge University Press

Access to resources Recommend Favorite

A note on (2K+1)-point conservative monotone schemes

By Tang Huazhong   Warnecke Gerald  

ESAIM: Mathematical Modelling and Numerical Analysis, Vol. 38, Iss. 2, 2010-03 ,pp. : 345-357

Edp Sciences

Access to resources Recommend Favorite

Topological Automata

By Jeandel Emmanuel  

Theory of Computing Systems, Vol. 40, Iss. 4, 2007-06 ,pp. : 397-407

Springer Publishing Company

Access to resources Recommend Favorite

A construction of a maximal monotone extension of a monotone map

By  

ESAIM: Proceedings, Vol. 20, Iss. issue, 2007-01 ,pp. : 93-104

Edp Sciences

Access to resources Recommend Favorite