The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Journal of the ACM
define other types of automata and show that the family of those sets of tapes accepted by at least one automaton of each of the different types is precisely Z, . ... For several different types (that is, definitions) of automata, the family of those sets of tapes accepted by at least one automaton of a par- ticular type is the same for all types, the so-called family ...doi:10.1145/321052.321056 fatcat:udv7kfc4zffx7lwdxilner74pq
For several different types (that is, definitions) of automata, the family of those sets of tapes accepted by at least one automaton of a par- ticular type is the same for all types, the so-called family ... The purpose of this note is to present a number of different types of one-way automata (that is, automata that read tapes from left to right only) and then show that the family of sets of tapes accepted ...
IBM Journal of Research and Development
cepts an infinite number of different tapes, and whether two automata accept precisely the same tapes. All three problems are shown to be solvable by effective algo- rithms. ... Namely, the domain and range of a relation defined by a two-tape automaton are sets of tapes defina- ble by one-tape automata. ...
Lecture Notes in Computer Science
We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages described by (generalized) P colony automata. ... We define a subclass of these computing devices satisfying a property which resembles the LL(k) property of context-free grammars, and study the possibility of parsing the characterized languages using ... by LL(1) P colony automata with different types of input mappings. ...doi:10.1007/978-3-030-00265-7_8 fatcat:ugqgh3yolja5xmpxgp2jjdrdae
Lecture Notes in Computer Science
In the case of generalized P colony automata, the computation of the colony defines an accepted multiset sequence, which is turned into a set of accepted string by a non-erasing mapping (as in P automata ... P i is a set of programs, each program is formed from k rules of the following types (where a, b ∈ V ): • tape rules of the form a T → b, or a T ↔ b, called rewriting tape rules and communication tape ...doi:10.1007/978-3-319-73359-3_11 fatcat:ftvr5owkarar7g44gjvnvtfroq
Sets of Tapes Accepted by Different Types of Automata, Seymour Ginsburg. as vet does not have a standard defini tion in the computer literature. ... This paper presents a number of different types of one-way automata (that is, automata which read types only from left to right) and then shows that the family of sets of tapes accepted by at leas! ...
finite automata cannot accept. ... Here we compare the computational power of two-way Watson-Crick automata and two-way Quantum finite automata and we observe that two-way Watson-Crick automata can accept a language which two-way quantum ... Theorem 3: L 1WKQFA -L 2QFA, where L 1WKQFA is the set of all languages accepted by Watson-Crick quantum finite automata and L 2QFA is the set of all languages accepted by two-way quantum automata. ...arXiv:2005.07569v1 fatcat:mlfagal35zezlk6lppg4cnu5kq
We next show the recognizability of n-dimensional connected tapes by real-time n-HSPA's. ... Cellular automata were investigated not only in the viewpoint of formal language theory, but also in the viewpoint of pattern recognition. Cellular automata can be classified into some types. ... By £ R [n-HSPA] we denote the class of the sets of all the n-dimensional tapes accepted by a real-time n-HSPA  . ...doi:10.2991/jrnal.2014.1.3.7 fatcat:cgd56o5l7bfungaemmeztuxgzi
is to determine the ‘weakest’ automaton which can accept the set of primes. ... , AUTOMATA by a (nondeterministic) offline Turing machine of tape complexity 7/? ...
We study the computational power of generalized P colony automata and show how it is influenced by the capacity of the system (the number of objects inside the cells of the colony) and the types of programs ... which are allowed to be used (restricted and unrestricted com-tape and all-tape programs, or programs allowing any kinds of rules). ... languages accepted by P automata. ...doi:10.1016/j.tcs.2017.12.011 fatcat:ut25avevlbfw7g6uxv2orprxmm
For each positive integer n, let -~eN(n ) be the class of sets accepted by a family of automata of type N, each with a read-only input with endmarkers and n two-way input heads. ... It is also shown that the class of sets accepted by deterministic (nondeterministic) two-way pushdown automata with n heads is properly included in the class of sets accepted by deterministic (nondeterministic ... with n heads is properly included in the class of sets accepted by such machines with Mn heads. The result now follows from Theorem I. ...doi:10.1016/s0022-0000(73)80048-0 fatcat:46b4bqwoxbcolaqgiicy7vwwvm
An exponential gap between the size of limited automata accepting unary languages and the size of equivalent finite automata is proved. ... Limited automata are one-tape Turing machines that are allowed to rewrite the content of any tape cell only in the first d visits, for a fixed constant d. ... by different variants of finite automata. ...doi:10.1016/j.ic.2019.01.002 fatcat:l4ts3gyqbzfmbh6jjsdz52xb3u
It is well known that the "store language" of every pushdown automaton -- the set of store configurations (state and stack contents) that can appear as an intermediate step in accepting computations -- ... A nice application of these store language results is also presented, showing a general technique for proving families accepted by many deterministic models are closed under right quotient with regular ... For an Ω store type, a k-Ω machine is a k-tape machine where each tape is of type Ω. Some types of one-way deterministic automata will also be examined in this paper. ...doi:10.1016/j.tcs.2018.05.036 fatcat:hnzdk34anjdr3jzlbpv7het3xy
The notion of a solitaire automaton is introduced to model the class of solitaire games. Space and time bounded solitaire automata with varying degrees of information are investigated. ... The power of solitaire automata is also determined when the information is perfect or zero. ... ACKNOWLEDGMENT Thanks to Anne Condon for carefully reading and commenting on a preliminary version of the paper. ...doi:10.1016/0022-0000(85)90007-8 fatcat:2jmvxe3fwrfl3a2m5tnjyqnbwa
For a type of nonstationary probabilistic automata, which differs nonessentially from the time-variant probabilistic automata type investigated by Turakainen, the author studies the relationship between ... for one class called monotone sdp, and that the family of sets accepted by nondeterministic monotone sdp is a full AFL. ...
« Previous Showing results 1 — 15 out of 3,803 results