نتایج جستجو برای: characterizable group
تعداد نتایج: 979331 فیلتر نتایج به سال:
In this paper we extend the work by Michaelis (1999) which shows how to encode an arbitrary Minimalist Grammar in the sense of Stabler (1997) into a weakly equivalent multiple contextfree grammar (MCFG). By viewing MCFG rules as terms in a free Lawvere theory we can translate a given MCFG into a regular tree grammar. The latter is characterizable by both a tree automaton and a corresponding for...
abstract the present study was conducted to investigate the effect of using model essays on the development of writing proficiency of iranian pre-intermediate efl learners. to fulfill the purpose of the study, 55 pre- intermediate learners of parsa language institute were chosen by means of administering proficiency test. based on the results of the pretest, two matched groups, one as the expe...
this study aimed to investigate the effects of listening strategy training on iranian efl learners listening comprehension and use of such strategies. this work, employing an experimental methodology, was conducted among 60 adult efl learners from a language institute in isfahan, iran, as participants. the participants, who were selected based on the results of a placement test, were assigned t...
this thesis basically deals with the well-known notion of the bear-invariant of groups, which is the generalization of the schur multiplier of groups. in chapter two, section 2.1, we present an explicit formula for the bear-invariant of a direct product of cyclic groups with respect to nc, c>1. also in section 2.2, we caculate the baer-invatiant of a nilpotent product of cyclic groups wuth resp...
Hertrampf’s locally definable acceptance types showed that many complexity classes can be defined in terms of polynomially 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 extended locally definable acceptance types as a generalization of Hertrampf’s concept in order to formally cap...
In this paper we show that non-context-free phenomena can be captured using only limited logical means. In particular, we show how to encode a Tree Adjoining Grammar [16] into a weakly equivalent monadic context-free tree grammar (MCFTG). By viewing MCFTG-rules as terms in a free Lawvere theory, we can translate a given MCFTG into a regular tree grammar. The latter is characterizable by both a ...
In this paper we extend the work by Michaelis (1999) which shows how to encode an arbitrary Minimalist Grammar in the sense of Stabler (1997) into a weakly equivalent multiple contextfree grammar (MCFG). By viewing MCFG-rules as terms in a free Lawvere theory we can translate a given MCFG into a regular tree grammar. The latter is characterizable by both a tree automaton and a corresponding for...
Bacteria are easily characterizable model organisms with an impressively complicated set of abilities. Among them is quorum sensing, a cell-cell signaling system that may have a common evolutionary origin with eukaryotic cell-cell signaling. The two systems are behaviorally similar, but quorum sensing in bacteria is more easily studied in depth than cell-cell signaling in eukaryotes. Because of...
We consider the Rosenfeld-Gröbner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials F , let M(F ) be the sum of maximal orders of differential indeterminates occurring in F . We propose a modification of the Rosenfeld-Gröbner algorithm, in whi...
The author has recently introduced a meta-level speciication for non-monotonic theories which has default theories , normal logic programs and separated autoepistemic theories as instances. Semantics including the stable, stationary and regular semantics are generalized for non-monotonic theories satisfying the speciication in a straightforward way. Most importantly, it is possible to prove pro...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید