Uniform Characterizations of Non-Uniform Complexity Measures

نویسندگان

  • José L. Balcázar
  • Josep Díaz
  • Joaquim Gabarró
چکیده

Non-uniform complexity measures originated in automata and formal languages theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits, straight line programs, and Turing machines with sparse oracles and time or space bounds. © 1985 Academic Press, Inc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exp-Uniform Distribution: Properties and Characterizations

In this paper, we study properties of exp-uniform distribution and its applications. We provide closed forms for the density function and moments of order statistics and we also discuss estimation of the parameters via the maximum likelihood method. We will present certain characterizations of exp-uniform distribution. The applications of this distribution are illustrated by fitting it to three...

متن کامل

Summability characterizations of uniform exponential and asymptotic stability of sets for difference inclusions

We present several equivalent characterizations of uniform global exponential stability (UGES) and uniform global asymptotic stability (UGAS) of arbitrary closed (not necessarily compact) sets for nonlinear difference inclusions. In particular, we provide several characterizations of these stability properties via summability criteria that do not require the knowledge of a Lyapunov function. We...

متن کامل

Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case

Recent research in nonmonotonic logic programming under the answer-set semantics studies different notions of equivalence. In particular, strong and uniform equivalence are proposed as useful tools for optimizing (parts of) a logic program. While previous research mainly addressed propositional (i.e., ground) programs, we deal here with the more general case of non-ground programs, and provide ...

متن کامل

Characterizations of the Non-uniform in Time Iss Property and Applications

For time-varying control systems various characterizations of the non-uniform in time input-to-state stability property (ISS) are provided. These characterizations enable us to derive sufficient conditions for ISS and feedback stabilization for composite systems.

متن کامل

Random languages for nonuniform complexity classes

A language A is considered to be random for a class C if for every language B in C the fraction of the strings where A and B coincide is approximately 1/2. We show that there exist languages in DSPACE(f(n)) which are random for the non-uniform class DSPACE(g(n))=h(n), where n, g(n) and h(n) are in o(f(n)). Non-uniform complexity classes were introduced by Karp and Lipton Karp and Lipton 1980] a...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Information and Control

دوره 67  شماره 

صفحات  -

تاریخ انتشار 1985