نتایج جستجو برای: with a descriptional
تعداد نتایج: 15555279 فیلتر نتایج به سال:
Various ways of quantifying the nondeterminism in finite automata have been considered since the 1970’s. Roughly speaking, a nondeterminism measure can count the number of accepting computations (ambiguity), the number of all computations (computation width) or the amount of nondeterminism on a single best (or worst) computation on a given input. This paper surveys results on the growth rate of...
testing plays a vital role in any language teaching program. it allows teachers and stakeholders, including program administrators, parents, admissions officers and prospective employers to be assured that the learners are progressing according to an accepted standard (douglas, 2010). the problems currently facing language testers have both practical and theoretical implications but the first i...
the present study set out (a) to examine the categories of pedagogical knowledge related to the act of teaching of novice and experienced teachers as gleaned from their verbal report of what they were thinking about while teaching and (b) to compare the categories of pedagogical knowledge of novice and experienced teachers. the aim of comparing these two groups of teachers was to see whether di...
in this thesis, we consider a mathematical model of cancer with completely unknown parameters. we study the stability of critical points which are biologically admissible. then we consider a control on the system and introduce situations at which solutions are attracted to critical points and so the cancer disease has auto healing. the lyapunov stability method is used for estimating the un...
Let Ln be the finite language of all n! strings that are permutations of n different symbols (n ≥ 1). We consider context-free grammars Gn in Chomsky normal form that generate Ln. In particular we study a few families {Gn}n≥1, satisfying L(Gn) = Ln for n ≥ 1, with respect to their descriptional complexity, i.e. we determine the number of nonterminal symbols and the number of production rules of...
The \observational content" of geometric logic is discussed and it is proposed that geometric logic is an appropriate basis for a Z-like speciication language in which schemas are used as geometric theory presentations. A descriptional mechanism of \schema entailment", generalizing type constructions and logical entailment, is deened and investigated in some examples, and is also used in deenin...
the present thesis is a study of postmodern historical novel with respect to the voice of women. according to postmodern historiography,the established institution of history is one of the other manifestations of patriarchys power which has silenced women. the study analyzes angela carters nights at the circus as a postmodern historical novel which makes its female characters transgress the pat...
Abstract We investigate finite automata whose state graphs are undirected. This means that for any transition from p to q consuming some letter a the input there exists symmetric as well. So, corresponding language families subregular, and in particular deterministic case, subreversible. In detail, we study operational descriptional complexity of nondeterministic undirected automata. To this en...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید