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.
This paper presents systematic synthesis procedures for Lupanov decoding networks. Decoding networks find applications in computer memories for the selection of a particular item of data addressed by a binary code, in counter circuits, in character-by-character code conversion circuits, in the synthesis of switching functions and also in the theoretical derivations of complexity bounds for arbitrary...
In this paper we consider the family of all languages generated by context-sensitive grammars whose time functions are linear-bounded. It is shown that this family is an AFL closed under reversal, and we show its relationship to several well-studied families of formal languages.
The model of an online multitape Turing machine is generalized by adding a bounded number of repositioning operations to the shift repertoire. It is proved that any such limited random access Turing machine can be effectively replaced by an equivalent conventional Turing machine which operates in the same time. This result yields simplified proofs and extensions of several results in the literature.
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.