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.
The automata roots of path sensitizing fault diagnosis are discussed. It is demonstrated that the path sensitizing diagnosis method is equivalent to a Moore type "machine identification" experiment for a machine class which contains good and faulty copies of a transmission path submachine of a complete machine. The maximum length of a complete set of path sensitizing tests for a machine...
Results on two distinct aspects of the theory of probabilistic automata (PA) are presented. Part I is devoted to two generalizations of the theory of loop-free decomposition of stochastic finite-state systems formulated by G. Bacon. The first generalization consists of making a modification in the decomposition scheme of Bacon to allow for the decomposition of a larger class of systems. The second...
This paper is concerned with the recognition of Context-free and deterministic 1-way stack (sa) languages, using n-dimensional Iterative Finitestate Automata (n-D IFA). A problem posed by Cole3 is also answered.
Iterative procedures have many advantages for computation, for instance an approximation to the final answer is provided even if the computation stops abruptly. A model for iterative computation is proposed where a procedure G executed repeatedly "converges" to a function f. A notion of approximation of functions on the integers is used based on limits of densities. Some results on the power...
A superAFL is a family of languages closed under union with unitary sets, intersection with regular sets, and nested iterated substitution and containing at least one nonunitary set. Every superAFL is a full AFL containing all context-free languages. If L is a full principal AFL, then S∞(L, the least superAFL containing L, is full principal. If L is not substitution closed, the substitution closure...
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...
An n-dimensional bug-automation is generalization of a finite state acceptor to n-dimensions. With each bug B, we associate the language L(B) which is the set of top rows of the n-dimensional rectangular arrays accepted by B. One-dimensional bugs define trivially the regular sets. Twodimensional bugs define precisely the context-sensitive languages, while bugs of dimension 3 or greater define all...
A context-sensitive grammar G is said to be CS(k) iff a particular kind of table-driven parser, Jk(G), exists. Corresponding to each Jk(G), we define a class of parsers Jk(G). Jk(G) is itself a Jk(G). The main results are: 1. Any processor Jk(G) for a CS(k) grammar G accepts exactly the sentences of G. 2. The set of languages generable by CS(k) grammars is exactly the set of languages accepted by...
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.