نتایج جستجو برای: myhill nerode theorem

تعداد نتایج: 144205  

Journal: :caspian journal of mathematical sciences 2012
a. neamaty s. mosazadeh m. bagherzadeh

this paper is devoted to the proof of the unique solvability ofthe inverse problems for second-order differential operators withregular singularities. it is shown that the potential functioncan be determined from spectral data, also we prove a uniquenesstheorem in the inverse problem.

Journal: :international journal of group theory 2014
francesco de giovanni martin l. newell alessio russo

‎motivated by a celebrated theorem of schur‎, ‎we show that if~$gamma$ is a normal subgroup of the full automorphism group $aut(g)$ of a group $g$ such that $inn(g)$ is contained in $gamma$ and $aut(g)/gamma$ has no uncountable abelian subgroups of prime exponent‎, ‎then $[g,gamma]$ is finite‎, ‎provided that the subgroup consisting of all elements of $g$ fixed by $gamma$ has finite index‎. ‎so...

2009
Linda McKie Jeff Hearn

Violence against women is a serious social problem and human rights concern. What is usually referred to as ‘domestic violence’ is predominately perpetrated by men known to women through intimate or familial relationships. While there are some patterns and probabilities amongst men who are violent to known women (Walby and Myhill 2001), there is no typical abuser, and domestic violence appears ...

Journal: :bulletin of the iranian mathematical society 2014
zhencai shen shirong li wujie shi

in this paper‎, ‎we give a complete proof of theorem 4.1(ii) and a new‎ ‎elementary proof of theorem 4.1(i) in [li and shen‎, ‎on the‎ ‎intersection of the normalizers of the derived subgroups of all‎ ‎subgroups of a finite group‎, ‎ j‎. ‎algebra, ‎323  (2010) 1349--1357]‎. ‎in addition‎, ‎we also give a generalization of baer's theorem‎.

We give a new proof of the well known Wedderburn's little theorem (1905) that a finite‎ ‎division ring is commutative‎. ‎We apply the concept of Frobenius kernel in Frobenius representation theorem in finite group‎ ‎theory to build a proof‎.

Journal: :Discrete Mathematics & Theoretical Computer Science 2021

We consider weighted tree automata (wta) over strong bimonoids and their initial algebra semantics run semantics. There are wta for which these different; however, bottom-up deterministic semirings, the difference vanishes. A is crisp-deterministic if it each transition by one of unit elements bimonoid. prove that class languages recognized same as recognizable step mappings. Moreover, we inves...

Darbo's fixed point theorem and its generalizations play a crucial role in the existence of solutions in integral equations. Meir-Keeler condensing operators is a generalization of Darbo's fixed point theorem and most of other generalizations are a special case of this result. In recent years, some authors applied these generalizations to solve several special integral equations and some of the...

In this note, we aim to present some properties of the space of all weakly fuzzy bounded linear operators, with the Bag and Samanta’s operator norm on Felbin’s-type fuzzy normed spaces. In particular, the completeness of this space is studied. By some counterexamples, it is shown that the inverse mapping theorem and the Banach-Steinhaus’s theorem, are not valid for this fuzzy setting. Also...

1997
Ch. Pollet Jeffrey B. Remmel

In this paper, we define and investigate the complexity of several nonmonotonic logics with quantified Boolean formulas as constraints. We give quantified constraint versions of the constraint programming formalism of Marek, Nerode, and Remmel [15] and of the natural extension of their theory to default logic. We also introduce a new formalism which adds constraints to circumscription. We show ...

Journal: :Ann. Pure Appl. Logic 1996
Anil Nerode Jeffrey B. Remmel

In this paper, we study the lower semilattice of NP-subspaces of both the standard polynomial time representation and the tally polynomial time representation of a countably infinite dimensional vector space V, over a finite field F. We show that for both the standard and tally representation of V, , there exists polynomial time subspaces U and FV such that U + V is not recursive. We also study...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید