نتایج جستجو برای: regular complete
تعداد نتایج: 474841 فیلتر نتایج به سال:
Piecewise testable languages form the first level of the Straubing-Thérien hierarchy. The membership problem for this level is decidable and testing if the language of a DFA is piecewise testable is NL-complete. The question has not yet been addressed for NFAs. We fill in this gap by showing that it is PSpace-complete. The main result is then the lower-bound complexity of separability of regula...
in this thesis, first the notion of weak mutual associativity (w.m.a.) and the necessary and sufficient condition for a $(l,gamma)$-associated hypersemigroup $(h, ast)$ derived from some family of $lesssim$-preordered semigroups to be a hypergroup, are given. second, by proving the fact that the concrete categories, semihypergroups and hypergroups have not free objects we will introduce t...
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
A regular language L is power-closed if whenever x ∈ L, also x ∈ L for all k ≥ 1. We show that given a deterministic finite automaton A, it is PSPACE-complete to decide whether the language accepted by A is power-closed.
Let $$r\ge 3$$ be a positive integer and $${\mathbb {F}}_q$$ the finite field with q elements. In this paper, we consider r-regular complete permutation property of maps form $$f=\tau \circ \sigma _M\circ \tau ^{-1}$$ where $$\tau $$ is PP over an extension {F}}_{q^d}$$ $$\sigma _M$$ invertible linear map . When additive, give general construction CPPs for any r. not many examples regular field...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید