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.
It is shown that a class of languages is defined by a class of two-way deterministic balloon automata if and only if that class is closed under marked union, marked Kleene closure and the inverse mappings performed by GSM's that move two ways on the input. Hence, the context sensitive languages and various time and tape complexity classes are equivalent to classes of 2DBA.
Some properties of multiprocessing systems, i.e. computing systems in which a set of computational elements share a pool of storage elements are investigated. In particular, the conditions for the output-functionality of these systems are studied, where a computing systems is defined as being output-functional when it produces the same sequence of outputs for the same program, initial state, and input...
A pushdown table machine can be simulated by a computer in time n log log n where n is the number of table machine operations. A finite state table machine can be simulated in linear time.
The stochastic sequential machine is invariably treated as the stochastic extension of the completely-specified deterministic machine. This paper investigates the incompletely-specified finite-state stochastic sequential machine from the viewpoint of machine equivalence and reduction. Definitions are chosen and procedures developed so that they reduce to the conventional froms in the special cases...
A new model of abstract automata is presented employing the concept of finite automata on a network. Each normal network n provided with a one-way input tape determines a family of languages nl. A representation theorem, analogous to the Chomsky-Schützenberger representation theorem for context free languages1, is proved for the class nl. One consequence is that nl is a principal full AFL generated...
The problem of assigning a probability to each string of a language L(G) generated by a grammar G is considered. Two methods are considered. One method assigns a probability to each production associated with G and the other assigns the probabilities on the basis of particular features of the language. Several necessary conditions that must be satisfied by these probability assignment techniques if...
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.