منابع مشابه
Fast Deterministic Simulation of Computations on Faulty Parallel Machines
A method of deterministic simulation of fully operational parallel machines on the analogous machines prone to errors is developed. The simulation is presented for the exclusive-read exclusive-write (EREW) PRAM and the Optical Communication Parallel Computer (OCPC), but it applies to a large class of parallel computers. It is shown that simulations of operational multiprocessor machines on faul...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملHeight-Deterministic Pushdown Automata
We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on the input are a priori fixed. Different subclasses of height-deterministic pushdown automata, strictly containing the class of regular languages and still closed under boolean language operations, are considered. Several such lan...
متن کاملDeterministic Frequency Pushdown Automata
A set L is (m,n)-computable iff there is a mechanism which on input of n different words produces n conjectures whether these words are in L, respectively, such that at least m of these conjectures are right. Prior studies dealt with (m,n)computable sets in the contexts of recursion theory, complexity theory and the theory of finite automata. The present work aims to do this with respect to com...
متن کاملA Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata
Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the nth level of the hierarchy is over an input alphabet with 2(n−1) elements. In this paper, we improve this result by showing that a binary alphabet is sufficient to establish this hierarchy. As a con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1978
ISSN: 0022-0000
DOI: 10.1016/0022-0000(78)90019-3