Acceptance of -Languages by Communicating Deterministic Turing Machines
نویسندگان
چکیده
Using a specific model of communicating deterministic Turing machines we prove that the class of -languages accepted by deterministic Turing machines via complete non-oscillating (complete oscillating) runs on the input coincides with the class of -definable ( -definable, respectively) -languages. email: [email protected] email: [email protected] 2 R. Freund and L. Staiger
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملObservability of Turing Machines: A Refinement of the Theory of Computation
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the relativity of mathematical languages used to describe the Turing machines. A deep investigation is performed on the interrelations between mechanical computations a...
متن کاملComparing Complexity Classes of Formal Languages
A property of polynomial complete languages is extended in order to better compare various classes of formal languages. We consider pairs (̂ ,,̂ 2̂ °̂ classes of languages such that there is a language L e 5?, with the property that L e ^if and / if &-\ Certain longstanding open questions in automata-based complexity have resurfaced recently due to the work on efficient reducibilities among combina...
متن کاملAmbiguity of omega-Languages of Turing Machines
An ω-language is a set of infinite words over a finite alphabet X. We consider the class of recursive ω-languages, i.e. the class of ω-languages accepted by Turing machines with a Büchi acceptance condition, which is also the class Σ1 of (effective) analytic subsets of X for some finite alphabet X. We investigate here the notion of ambiguity for recursive ω-languages with regard to acceptance b...
متن کاملDeterministic Turing Machines in the Range between Real-time and Linear-time Justus-liebig- Universit at Gieeen Deterministic Turing Machines in the Range between Real-time and Linear-time
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by such devices with time bounds of the form n + r(n) where r 2 o(n) is a sublinear function. It is shown that there exist innnite time hierarchies of separated complexity classes in that range. For these classes weak clos...
متن کامل