首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   27篇
  免费   1篇
  国内免费   2篇
数理化   30篇
  2022年   1篇
  2021年   1篇
  2020年   1篇
  2019年   1篇
  2015年   1篇
  2014年   1篇
  2013年   2篇
  2012年   1篇
  2011年   1篇
  2010年   1篇
  2008年   1篇
  2007年   2篇
  2006年   1篇
  2005年   1篇
  2003年   1篇
  2002年   1篇
  2000年   1篇
  1997年   2篇
  1995年   2篇
  1993年   1篇
  1985年   1篇
  1982年   1篇
  1979年   2篇
  1969年   1篇
  1968年   1篇
排序方式: 共有30条查询结果,搜索用时 15 毫秒
1.
We consider context-free grammars of the form G = {f → fb1+b2+1ga1+a2, g → fb1 ga1+1},where ai and bi are integers sub ject to certain positivity conditions. Such a grammar G gives rise to triangular arrays {T(n, k)}0≤k≤n satisfying a three-term recurrence relation. Many combinatorial sequences can be generated in this way. Let Tn (x) =∑nk=0T(n, k)xk. Based on the differential operator with respect to G, we define a sequence of linear operators Pn such that Tn+1(x) = Pn(Tn(x)). Applying the characterization of real stability preserving linear operators on the multivariate polynomials due to Borcea and Br?ndén, we obtain a necessary and sufficient condition for the operator Pn to be real stability preserving for any n. As a consequence, we are led to a sufficient condition for the real-rootedness of the polynomials defined by certain triangular arrays, obtained by Wang and Yeh.Moreover, as special cases we obtain grammars that lead to identities involving the Whitney numbers and the Bessel numbers.  相似文献   
2.
偶动画是动画领域一个重要的分支,与传统手绘动画同步出现,甚至更早。偶动画作品以其独特的拍摄方法和艺术魅力,为众多艺术家和观众所喜爱。偶动画影片设计周期长、工作量大、生产过程复杂、经济风险高,用传统手工工艺制作完成一部5 min的定格动画影片,通常需要数年。本文以丹麦知名动画导演克里多夫·皮拉丹的《柏树山上的风》及德国格里高利·祖坎导演的《龙焰火枪》为例,提出以故事情节(storyline(i)),?i1,2,,n?与情景链(scenario?chain)语法有限集的形式语言表达式分解偶动画电影的故事元素,通过叙事空间(narrative?space)中镜头画面的组接逻辑,形成不同叙事结构,以分析定格动画电影的故事寓意(implied?meaning),从故事计算的角度将其转化为标准化设计流程,为构建偶动画电影故事建模理论以及辅助智能计算提供思路,方法提高了偶动画电影的设计与制作效率,为多学科协同创作提供了新模式,使普通偶动画爱好者也能参与创作。  相似文献   
3.
本文对提出的最大乘积型Fuzzy文法与最大乘积型Fuzzy自动机的关系作了详细讨论,得出了两个重要的结论。即:由给定的最大乘积型Fuzzy正规文法可构造一个最大乘积型Fuzzy自动机使得二者接受的语言集相同,反之亦然。从而达到自动识别语言的目的。  相似文献   
4.
Properties of context-free languages and grammars permitting deterministic top-down recognition with bounded lookahead are discussed. In particular, it is shown that for eachk>1 there are such languages requiring a lookahead of at leastk characters.  相似文献   
5.
利用火焰原子吸收光谱法(FAAS),测定了硫酸铜、硫酸锌、膨润土、米糠、氧化锌、菜渣、盐等7种肉牛饲料添加剂中铅(Pb)元素的含量.各添加剂的加标回收率在98%-108%之间,相对标准偏差(RSD)小于1.3%,具有良好的准确度和精确度.结果表明,试验中所测的硫酸铜、硫酸锌、氧化锌添加剂中铅含量严重超出国家标准.  相似文献   
6.
We present a new axiomatization of the non-associative Lambek calculus. We prove that it takes polynomial time to reduce any non-associative Lambek categorial grammar to an equivalent context-free grammar. Since it is possible to recognize a sentence generated by a context-free grammar in polynomial time, this proves that a sentence generated by any non-associative Lambek categorial grammar can be recognized in polynomial time.  相似文献   
7.
Turn bounded pushdown automata with different conditions for beginning a new turn are investigated. Their relationships with closures of the linear context-free languages under regular operations are studied. For example, automata with an unbounded number of turns that have to empty their pushdown store up to the initial symbol in order to start a new turn are characterized by the regular closure of the linear languages. Automata that additionally have to re-enter the initial state are (almost) characterized by the Kleene star closure of the linear languages. For both a bounded and an unbounded number of turns, requiring to empty the pushdown store is a strictly stronger condition than requiring to re-enter the initial state. Several new language families are obtained which form a double-stranded hierarchy. Closure properties of these families under AFL operations are derived. The regular closure of the linear languages share the strong closure properties of the context-free languages, i.e., the family is a full AFL. Interestingly, three natural new language families are not closed under intersection with regular languages and inverse homomorphism. Finally, an algorithm is presented parsing languages from the new families in quadratic time.  相似文献   
8.
We prove a representation theorem for (abstract) residuated algebras: each residuated algebra is isomorphically embeddable into a powerset residuated algebra. As a consequence, we obtain a completeness theorem for the Generalized Lambek Calculus. We use a Labelled Deductive System which generalizes the one used by Buszkowski [4] and Pankrat'ev [17] in completeness theorems for the Lambek Calculus.  相似文献   
9.
Two axiomatizations of the nonassociative and commutative Lambek syntactic calculus are given and their equivalence is proved. The first axiomatization employs Permutation as the only structural rule, the second one, with no Permutation rule, employs only unidirectional types. It is also shown that in the case of the Ajdukiewicz calculus an analogous equivalence is valid only in the case of a restricted set of formulas. Unidirectional axiomatizations are employed in order to establish the generative power of categorial grammars based on the nonassociative and commutative Lambek calculus with product. Those grammars produce CF-languages of finite degree generated by CF-grammars closed with respect to permutations.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号