The intersection problem for alphabetic vector monoids
نویسندگان
چکیده
منابع مشابه
The Intersection Problem for Finite Monoids
We investigate the intersection problem for finite monoids, which asks for a given set of regular languages, represented by recognizing morphisms to finite monoids from a variety V, whether there exists a word contained in their intersection. Our main result is that the problem is PSPACE-complete if V 6⊆ DS and NP-complete if 1 ( V ⊆ DO. Our NP-algorithm for the case V ⊆ DO uses novel methods, ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe intersection problem for cubes
For all integers m, nand t, we determine necessary and sufficient conditions for the existence of (1) a pair of 3-cube decompositions of Kn having precisely t common 3-cubes; and (2) a pair of 3-cube decompositions of Km,n having precisely t common 3-cubes.
متن کاملIntersection Theorems for Vector Spaces
[ n] qni_ 1 = IT / i . t q O""i<, q -1 Since we always refer to the same K, we will write this simply as [7]. If A, Bare subspaces of V, A < B, then B/ A denotes the factor space of B by A. If An B = (O)-the zero-space, then AB / A is the canonical projection of B into V / A. Suppose 1 ~ k < nand !¥ = {Fl> .. . , Fm} is a family of distinct k-dimensional subspaces of V. For 0 ~ s ~ k, let !¥(s)...
متن کاملWord Problem Languages for Free Inverse Monoids
This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of rank 1 is both 2-context-free (an intersection of two context-free languages) and ET0L; that the co-word problem of the free inverse monoid of rank 1 is context...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1994
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1994283-402951