Search results for "languages"
showing 10 items of 2101 documents
A C0-Semigroup of Ulam Unstable Operators
2020
The Ulam stability of the composition of two Ulam stable operators has been investigated by several authors. Composition of operators is a key concept when speaking about C0-semigroups. Examples of C0-semigroups formed with Ulam stable operators are known. In this paper, we construct a C0-semigroup (Rt)t&ge
Ulam Stability for the Composition of Operators
2020
Working in the setting of Banach spaces, we give a simpler proof of a result concerning the Ulam stability of the composition of operators. Several applications are provided. Then, we give an example of a discrete semigroup with Ulam unstable members and an example of Ulam stable operators on a Banach space, such that their sum is not Ulam stable. Another example is concerned with a C 0 -semigroup ( T t ) t &ge
Generalized F-Contractions on Product of Metric Spaces
2019
Our purpose in this paper is to extend the fixed point results of a &psi
A Note on States and Traces from Biorthogonal Sets
2019
In this paper, following Bagarello, Trapani, and myself, we generalize the Gibbs states and their related KMS-like conditions. We have assumed that H 0 , H are closed and, at least, densely defined, without giving information on the domain of these operators. The problem we address in this paper is therefore to find a dense domain D that allows us to generalize the states of Gibbs and take them in their natural environment i.e., defined in L &dagger
Words with the Maximum Number of Abelian Squares
2015
An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain \(\varTheta (n^2)\) distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length n grows quadratically with n.
Statistical guidelines for quality control of next-generation sequencing techniques.
2021
Condition-specific statistical guidelines and accurate classification trees for quality control of functional genomics NGS files (RNA-seq, ChIP-seq and DNase-seq) have been generated using thousands of reference files from the ENCODE project and made available to the community.
Snapshots of a solid-state transformation: coexistence of three phases trapped in one crystal† †Electronic supplementary information (ESI) available:…
2016
Solvent extrusion leads to crystallographic–magnetic transition within a molecular complex via an intermediate that can be trapped and characterized.
Quantum Finite State Transducers
2000
We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their `little brothers', the quantum finite automata, the power of qfst is incomparable to that of their probabilistic counterpart. This we show by discussing a number of characteristic examples.
On the class of languages recognizable by 1-way quantum finite automata
2000
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
The class of languages recognizable by 1-way quantum finite automata is not closed under union
2000
In this paper we develop little further the theory of quantum finite automata (QFA). There are already few properties of QFA known, that deterministic and probabilistic finite automata do not have e.g. they cannot recognize all regular languages. In this paper we show, that class of languages recognizable by QFA is not closed under union, even not under any Boolean operation, where both arguments are significant.