منابع مشابه
EMBEDDING /c-REGULAR GRAPHS IN /c +1-REGULAR GRAPHS
Given a A:-regular graph G of order n, what is the minimum number v(G) of extra vertices required to embed G in a /<+1-regular graph? Clearly v(G) = 0 precisely when the complement G of G has a 1-factor—in particular, when n ^ 2k is even. Suppose G has no 1-factor: if n, k have opposite parity we show that v(G) = 1, while if n, k have the same parity (which must then be even with n < 2k) we sho...
متن کاملPumping and Counting on the Regular Post Embedding Problem
The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular constraints on admissible solutions. It is known that this problem is decidable, albeit with very high complexity. We consider and solve variant problems where the set of solutions is compared to regular constraint sets and where on...
متن کاملThe ω-Regular Post Embedding Problem
Post’s Embedding Problem is a new variant of Post’s Correspondence Problem where words are compared with embedding rather than equality. It has been shown recently that adding regular constraints on the form of admissible solutions makes the problem highly non-trivial, and relevant to the study of lossy channel systems. Here we consider the infinitary version and its application to recurrent re...
متن کاملCutting through Regular Post Embedding Problems
The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining directness and codirectness in Post Embedding problems leads to undecidability.
متن کاملEmbedding Finite Automata within regular Expressions
Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure of regular expression based formulas, as well as of many LTL and CTL formulas, involves constructing an automaton which runs in parallel with the model. In this paper we re-examine this construction. Instead of directly transla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1998
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(97)00109-6