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.
In this paper, we summarize and extend some recent results about the properties of NP complete sets and related results about the structure of feasible computations.
We consider language families obtained from context-free languages by complete cancellation of substrings from the Dyck language with one pair of parentheses. The class of such languages contains languages with arbitrary exponential growth, the Petri net languages, and NP-complete sets.
The method of built-in self-testing is proposed using imperfect duplication. As an example reducing the value of the average probability of missing a fault in the case of BIST of single-output combinational circuit has been shown.
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.