Automaticity I: Properties of a Measure of Descriptional Complexity

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.53, Iss.1, 1996-08, pp. : 10-25

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

Automaticity II: Descriptional complexity in the unary case

By Pomerance C. Robson J.M. Shallit J.

Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. : 181-201

Elsevier

Access to resources Recommend Favorite

The Garland Measure and Computational Complexity of Stack Programs

By Kristiansen L. Niggl K.-H.

Electronic Notes in Theoretical Computer Science, Vol. 90, Iss. 1, 2003-11 ,pp. : 15-35

Elsevier

Access to resources Recommend Favorite

Effective category and measure in abstract complexity theory

By Calude C. Zimand M.

Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. : 307-327

Elsevier

Access to resources Recommend Favorite

Interaction-based complexity measure of manufacturing systems using information entropy

By Cho S.

International Journal of Computer Integrated Manufacturing, Vol. 22, Iss. 10, 2009-10 ,pp. : 909-922

Taylor & Francis Ltd

Access to resources Recommend Favorite

Decimation-invariant sequences and their automaticity

By Barbe A. Skordev G.

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 379-403

Elsevier

Access to resources Recommend Favorite