Hertrampf’s locally definable acceptance types show that many complexity classes can be defined in terms of polynomial time bounded NTM’s with simple local conditions on the nodes of its computation tree, rather than global concepts like number of accepting paths etc. We introduce a modification of Hertrampf’s locally definable acceptance types which allows to get a larger number of characteriz...

Hertrampf's locally de nable acceptance types show that many complexity classes can be de ned in terms of polynomial time bounded NTM's with simple local conditions on the nodes of its computation tree, rather than global concepts like number of accepting paths etc. We introduce a modi cation of Hertrampf's locally de nable acceptance types which allows to get a larger number of characterizable...

Abstract This study is the first to investigate subject-level variability in sociolinguistic evaluative judgements by 30 adult L2 German learners and explore whether observed characterizable as a function of individual differences proficiency, exposure, motivation. Because group-level estimates did not paint an accurate picture individual, we propose methods capable integrating population-level...

let $g$ be a finite group and $pi(g)$ be the set of all the prime‎ ‎divisors of $|g|$‎. ‎the prime graph of $g$ is a simple graph‎ ‎$gamma(g)$ whose vertex set is $pi(g)$ and two distinct vertices‎ ‎$p$ and $q$ are joined by an edge if and only if $g$ has an‎ ‎element of order $pq$‎, ‎and in this case we will write $psim q$‎. ‎the degree of $p$ is the number of vertices adjacent to $p$ and is‎ ...

Let G be a finite group. The character degree graph [Formula: see text] of G is the graph whose vertices are the prime divisors of character degrees of G and two vertices p and q are joined by an edge if pq divides the character degree of G. Let [Formula: see text] be the projective special linear group of degree n over a finite field of order q. Khosravi et. al. have shown that the simple grou...

Function distinguishable languages were introduced as a new methodology of defining characterizable subclasses of the regular languages which are learnable from text. Here, we give details on the implementation and the analysis of the corresponding learning algorithms. We also discuss problems which might occur in practical applications.

-Using Generalized Harmonic Analysis, a complete description of parameter convergence in Model Reference Adaptive Control (MRAC) is given in terms of the spectrum of the exogenous reference input signal. Roughly speaking, if the reference signal "contains enough frequencies" then the parameter vector converges to its correct value. If not, it converges to an easily characterizable subspace in p...

The authors have been investigating metrics of extremely low frequency magnetic field exposure under different circumstances. In this paper, we describe the properties of magnetic fields in homes, in the vicinity of powerlines, on trains and from a library security system. We conclude that there are key differences between each of these fields. This suggests that there may be a characterizable ...