不可解的

Let f be a solution of the higher order differential equation, a sufficient condition for f belonging to the weighted Dirichlet space D or to the Bergman space L, respectively, is obtained.

设f是高阶微分方程的解，得到了f分别属于加权Dirichlet空间D和Bergman空间L的一个充分条件，并得到了f是不可容许解的一个充分条件。

Firstly, it's proved that the base of free monoid is unique, and that the equation of a base, a generating set and a irreducible generating set in the semigroup with length; Secondly, it's given the relation of a primitive word and a word of indecomposable--Let and is indecomposable, then is primitive ;And by using the length's method and chart,some properties of primitive word have been proved and the solutions of the equation , are discussed; Lastly, on the base of some proposition in Free monoids and Languages ,the proofs of some properties are improved by instruction. For example: Let be a primitive word over X, where .Then is a code. And let then if and only if {} is a code.

首先，讨论了含幺半群中基的基本性质及基与最小生成元集的联系，并给出了含幺半群中基、生成元集、不可约生成元集三者之间的关系；证明了在有唯一长度的半群S中，不可约生成元集、基、最小生成元集三者之间的等价关系；其次，讨论了字的组合与分解性，得出了字的本原性与不可分解性之间的关系---若为不可分解的，则一定是本原的，反之，不一定真；并运用图示法证明了字的可补性理论，讨论了方程，的可解性；在此基础上，用归纳法进一步证明了本原字与码的有关命题--若是X上的一个本原字，其中，则是一个码；若则当且仅当{}是一个码。

When the graph Г′ is not connected, Our results are as following: if G is non-solvable then G is a Frobenius group; and if G is solvable then 2≤nl ≤4 for Fitting height nl of G.

我们给出了Γ′不连通时有限群G的结构：当G不可解时，G只能是Frobenius群；而当G可解时，也有2≤nl≤4。

The CTM is suitable for the case that all E-type influentially uncontrollable subnets are state graphs, and the outstanding virtue is that the designed controller is explicit. The EMM is suitable for the case that all F-type influentially uncontrollable subnets are normalized cascade Petri nets, and the advantage is that control patterns can be on-line computed within polynomial times.

约束变换法适用于所有E-型影响不可控子网为状态图这种特殊的场合，用该方法所综合的控制器最大的优点在于所获得的控制器是显式的；特征标识法适用于所有F-型影响不可控子网为规范化序状Petri网这种场合，用该方法设计的控制器在线运算工作量是多项式可解的。

Turing Machines, A Brief Introduction to the Undecidability, Intractability and Complexity of Problems.

图灵机，问题的不可解性、难解性和复杂性等计算理论初步知识。

For different polynomials g, if the characteristic polynomial of a n matrix A is irreducible, then we get some theorems to determine matrix equations g =A solvable; if it is reducible, then, to see n-dimension space vectors M over a field F as F-module, we use module theory to determine these equations solvable such that it is simpler and clearer to investigate these questions.

对于不同多项式g，当n阶矩阵A的特征多项式为不可约的，我们给出了矩阵方程g=A有解的判定定理；当A的特征多项式为可约的，把域F上的n维线性空间M作为由A导出的F -模，我们利用模论知识来决定矩阵方程g=A有解性，从而使这一问题变了简单，研究思路更加清晰。

Using the index arrays to discuss the operation of necklace word .construct a sovable subalgebra of NQ,which is not nilpotent.

当箭图中有长度大于1的循环，且无圈时，构造了N_Q的非可解子代数，从而证明了N_Q是不可解李代数。

The third part of this paper aims to study the global solvability or nonsolvability of a semilinear parabolic equation with singular potential.

论文的第三部分是对带奇异项的半线性抛物方程的整体可解性和不可解性的研究。

And the sufficient and necessary conditions are obtained and the uniqueness of T is discussed and an algorithm for solving the inverse problem is provided. The other kind of structure inverse eigenvalue problem is for unitary Hessenberg matrices with positive subdiagonal elements. That is, a unitary Hessenberg matrices with positive sub-diagonal elements can be constructed when its eigenvalues and the eigenvalues of H_(11) and H_(22) are known. Here H_(11) and H_(22) are rank-one modifications of k × k leading principal submatrix of H and of its × remain submatrix respectively. In the end, the uniqueness of H and an algorithm is obtained.

文中首先讨论了这三组特征值之间的交错关系，接着确定了该逆问题有解的充要条件，并论证了其解的唯一性问题，最后给出了相应的数值算法；本文第二个问题解决的是一类不可约的酉Hessenberg阵的逆特征值问题：即一个不可约的酉Hessenberg阵可以由它的特征值、它的前k阶秩一修正的顺序主子阵的特征值以及它的后n—k阶余子阵的秩一修正阵的特征值来确定，文中最后讨论了唯一性和相应的算法。

This paper discusses the drawing of hyperbola normal through a point outside the hyperbola and points out the unsolvability of geometric drawing method and the unintegrality of optimization method.

对过双曲线外一定点的法线作图问题作了探讨，提出了几何作图法的不可解性及优化法解的不全性。

We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.

索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称；三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起，称之为挽歌体诗人或者史诗诗人，他们被称为诗人，似乎只是因为遵守格律写作，而非他们作品的模仿本质。

The relationship between communicative competence and grammar teaching should be that of the ends and the means.

交际能力和语法的关系应该是目标与途径的关系。