Class hierarchies, though theoretically reusable, have generally not seen much practical reuse in applications, due in part to the inflexibility of the inheritance relationship. We present a technique, base class injection, that allows the creation of generative class hierarchies that may be adapted by adding new methods, data members, and ancestor classes without modification to the class libr...

Identification of programs for computable functions from their graphs by algorithmic devices is a well studied problem in learning theory. Freivalds and Chen consider identification of ‘minimal’ and ‘nearly minimal’ programs for functions from their graphs. Freivalds showed that there exists a Gödel numbering in which only finite classes of functions can be identified using minimal programs. To...

In this paper, we analyze multi-dimensional quasi-asymptotically $c$-almost periodic functions and their Stepanov generalizations as well Weyl type functions. We also several important subclasses of the class reconsider notion semi-$c$-periodicity in setting, working general framework Lebesgue spaces with variable exponent. provide certain applications our results to abstract Volterra integro-d...

We study an interesting class of Banach function algebras of innitely dierentiable functions onperfect, compact plane sets. These algebras were introduced by Honary and Mahyar in 1999, calledLipschitz algebras of innitely dierentiable functions and denoted by Lip(X;M; ), where X is aperfect, compact plane set, M = fMng1n=0 is a sequence of positive numbers such that M0 = 1 and(m+n)!Mm+n ( m!Mm)...

This paper introduces a mathematical framework within which a wide variety of known and new inequalities can be viewed from a common perspective. Probability and expectation inequalities of the following types are considered: (a) P(ZEA) ~ P(Z'EA) for some class of sets A, (b) Ek(Z) ~ Ek(Z') for some class of functions k, and (c) Et(Z) ~ Ek(Z') for some class of pairs of functions t and k. It is...

Thi s paper considers computa tional characteristics of boolean automata networks with rand om interconnections. The subjects of interest are: th e number of stationary points, the convergence of th e dynamic flow to th ese points, compactness of the at tract ion basins, number of logical switchings during the run , and informational content of the phase portrait. For a special class of uniform...

We investigate the class of functions computable by uni-transitional Watson–Crick D0L systems: only one complementarity transition is possible during each derivation. The class is characterized in terms of a certain min-operation applied to Z-rational functions. We also exhibit functions outside the class, and show that the basic decision problems are equivalent or harder than a celebrated open...

The leading economic explanation for tipping –that is, explanation why the practice is socially beneficial, not why individuals leave tips even though it is not narrowly advantageous to them– is that it confers an incentive to provide personal services. This fits many instances in which tipping is common but does not fit the taxicab business very well. We propose two novel explanations of tippi...

The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of Rand J -trivial regular languages, and prove that n! and ⌊e(n −...