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.
For discrete event systems, we study the problem of predicting failures prior to their occurrence, also referred to as prognosis, in the inference-based decentralized framework where multiple decision-makers interact to make the global prognostic decisions. We characterize the class of systems for which there are no missed detections (all failures can be prognosed prior to their occurrence) and no...
Expanding graphs are the basic building blocks used in constructions of graphs with special connectivity properties such as superconcentrators. The only known explicit method (Margulis[7], Gabber and Galil[5]) of constructing arbitrarily large expanding graphs with a linear number of edges, uses graphs whose edges are defined by a finite set of linear mappings restricted to a two-dimensional set,...
Two complementary but equivalent semantic interpretations of a high level probabilistic programming language are given. One of these interprets programs as partial measurable functions on a measurable space. The other interprets programs as continuous linear operators on a Banach space of measures. It is shown how the ordered domains of Scott and others are embedded naturally into these spaces. Two...
Motivated by an elementary programming system for formal language generation, we propose a generalized a pushdown acceptor which uses both a checking stack and a pushdown store in original manner. In the analysis of the machine-model parallel rewriting appears to be a fundamental tool for breaking the implicit recursion-structure. Variations of the machine-model (in the sense of Cook) lead to a natural...
This paper presents several representations of the recursively enumerable (r.e.) sets. The first states that every r.e. set is the homomorphic image of the intersection of two linear context-free languages. Another states that every r.e. set is accepted by an on-line Turing acceptor with two pushdown stores such that in every computation, each pushdown store can make at most one reversal (that is,...
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.
A definition of meaning is given for languages that possess a parsing algorithm. This definition leads to consider a class of mappings called syntax directed mappings. The behavior of contextfree languages is studied in relation to the defined class of mappings and it is shown that the translation can be implemented in two passes: first by a nondeterministic push down automaton and then by a two-way...
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.