Automaticity II: Descriptional complexity in the unary case

Author： Pomerance C. Robson J.M. Shallit J.

Publisher： Elsevier

ISSN： 0304-3975

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

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 I: Properties of a Measure of Descriptional Complexity

By Shallit J. Breitbart Y.

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

Academic Press

Access to resources Recommend Favorite

Algebraic transformation of unary partial algebras II: Single-pushout approach

By Burmeister P. Monserrat M. Rossello F. Valiente G.

Theoretical Computer Science, Vol. 216, Iss. 1, 1999-03 ,pp. : 311-362

Elsevier

Access to resources Recommend Favorite

On the complexity of case-based planning

By Liberatore P.

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 17, Iss. 3, 2005-09 ,pp. : 283-295

Taylor & Francis Ltd

Access to resources Recommend Favorite

Complexity in the case against accuracy estimation

By Nock R.

Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. : 143-165

Elsevier

Access to resources Recommend Favorite

Unary PCF is decidable

By Loader R.

Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. : 317-329

Elsevier

Access to resources Recommend Favorite