$\mathrm{Pal}^k$ Is Linear Recognizable Online
نویسندگان
چکیده
Given a language L that is online recognizable in linear time and space, we construct a linear time and space online recognition algorithm for the language L ·Pal, where Pal is the language of all nonempty palindromes. Hence for every fixed positive k, Pal is online recognizable in linear time and space. Thus we solve an open problem posed by Galil and Seiferas in 1978.
منابع مشابه
Recognition by prime graph of the almost simple group PGL(2, 25)
Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...
متن کاملAsymptotic behaviour of associated primes of monomial ideals with combinatorial applications
Let $R$ be a commutative Noetherian ring and $I$ be an ideal of $R$. We say that $I$ satisfies the persistence property if $mathrm{Ass}_R(R/I^k)subseteq mathrm{Ass}_R(R/I^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{Ass}_R(R/I)$ denotes the set of associated prime ideals of $I$. In this paper, we introduce a class of square-free monomial ideals in the polynomial ring $R=K[x_1,ld...
متن کاملGeneralized $F$-contractions in Partially Ordered Metric Spaces
We discuss about the generalized $F$-contraction mappings in partially ordered metric spaces. For this, we first introduce the notion of ordered weakly $F$-contraction mapping. We also present some fixed point results about this type of mapping in partially ordered metric spaces. Next, we introduce the notion of $acute{mathrm{C}}$iri$acute{mathrm{c}}$ type generalized ordered weakly $F$-contrac...
متن کاملModal $\mathrm{I}\mathrm{n}\mathrm{t}\mathrm{u}\mathrm{i}\mathrm{t}\mathrm{i}\mathrm{o}\mathrm{n}\tilde{\mathrm{l}}\mathrm{s}\mathrm{t}\mathrm{i}\mathrm{C}$ Logics and Predicate Superintuitionistic Logics: $\mathrm{C}_{0\Gamma \mathrm{r}\mathrm{e}..\mathrm{S}},\mathrm{p}$
In this note we deal with intuitionistic modal logics over $\mathcal{M}\mathcal{I}PC$ and predicate superintuitionistic logics. We study the correspondence between the lattice of all (normal) extensions of MTPC and the lattice of all predicate superintuitionistic logics. Let $\mathrm{L}_{Prop}$ denote a propositional language which contains two modal operators $\square$ and $\mathrm{O}$ , and $...
متن کاملFuzzy Graph Rewritings
This paper presents fuzzy graph rewriting systems with fuzzy relational calculus. In this paper fuzzy graph means crisp set of vetices and fuzzy set of edges. We provide $\mathrm{f}\mathrm{u}\mathrm{z},7,\mathrm{y}$ relational calculus witll Heyting algebra. Formalizing rewriting system of fuzzy graphs it is important to $\mathrm{c}\cdot 1_{1\mathrm{t})\mathrm{t}}.\mathrm{q}\mathrm{C}1$ how to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1404.5244 شماره
صفحات -
تاریخ انتشار 2014