An Optimal Lower Bound for Nonregular Languages
نویسندگان
چکیده
In this paper we prove a tight log n lower bound on the product of strong space and input head reversals for any Turing machine (equipped with a read only input tape) accepting a nonregular language.
منابع مشابه
The Minimum Amount of Useful Space: New Results and New Directions
We present several new results on minimal space requirements to recognize a nonregular language: (i) realtime nondeterministic Turing machines can recognize a nonregular unary language within weak log logn space, (ii) log logn is a tight space lower bound for accepting general nonregular languages on weak realtime pushdown automata, (iii) there exist unary nonregular languages accepted by realt...
متن کاملNonregular languages and minimization of DFAs
While the regular languages have nice properties (as we have seen in the early part of the course), unfortunately many languages that we encounter in practice are nonregular. We discuss a method to prove that a given language is nonregular. This material is from Section 9.4 in the textbook. As the last topic on regular languages we consider an algorithm to minimize deterministic state diagrams....
متن کاملOne Pebble Versus log(n) Bits
We show that, for any ε > 0, there exists a language accepted in strong ε·log n space by a 2-way deterministic Turing machine working with a single binary worktape, that cannot be accepted in sublogarithmicweak space by any pebble machine (i.e., a 2-way nondeterministic Turing machine with one pebble that can be moved onto the input cells). Moreover, we provide optimal unary lower bounds on the...
متن کاملWeapon scheduling in naval combat systems for maximization of defense capabilities
Air defense is a crucial area for all naval combat systems. In this study, we consider a warship equipped with an air-defense weapon that targets incoming threats using surface-to-air missiles. We define the weapon scheduling problem as the optimal scheduling of a set of surface-to-air missiles of a warship to a set of attacking air threats. The optimal scheduling of the weapon results in an in...
متن کاملThe World of Unary Languages: A Quick Tour
We give two flashes from the world of unary languages related to the study of tight computational lower bounds for nonregular language acceptance. They show both an interesting dissymmetry with the general case, and the flavor and some typical number theoretic tools of unary computations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 50 شماره
صفحات -
تاریخ انتشار 1994