The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Given a strong bimonoid P, we introduce three different behaviors of a weighted finite automaton over P (called a P−valued finite automaton), named the initial object semantics, final object semantics and run semantics. We define four forms for a P−valued nondeterministic finite automaton (P−NFA) and three forms for a P−valued deterministic finite automaton (P−DFA). Under the above-mentioned semantics,...
This paper aims to find better algorithms for solving parameter reduction problems of soft sets and gives their potential applications. Firstly, we define the matrix of dominant support parameters and use it to explain the essential reasons for the different choice values of arbitrary pair of objects. Then we propose techniques for translating the normal and pseudo parameter reduction problems of...
RAID codes are extensive developed to supply high reliability and high available for storage systems in modern data center. For example, RAID-0, RAID-4, RAID-5 and RAID-6 are wide deployed in in-production storage systems, of which RAID-6 codes are popular with the ability for tolerate two-diskfailure. The paper focus on performance evaluation of storage systems powered by RAID-6, firstly propose...
Given a strong bimonoid P, we introduce P-valued non-deterministic Turing machines (P-NTM), P-valued non-deterministic Turing machines with classical transition (P-NTMc), P-valued deterministic Turing machines (P-DTM) and P-valued non-deterministic Turing machines with the tape-head no remove (P-NTMS). We adapt depth-first and width-first methods for defining the weight of acceptance of languages...
In this paper, the concepts of weighted transducers over strong bimonoids and their input-output-functions are introduced. Further more, the input-functions and output-functions induced by the input-output-functions of weighted transducers over strong bimonoids are given. It is the most important that the input-functions and output-functions of weighted transducers over strong bimonoids can be realized...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.