2,319 research outputs found
From Finite Automata to Regular Expressions and Back--A Summary on Descriptional Complexity
The equivalence of finite automata and regular expressions dates back to the
seminal paper of Kleene on events in nerve nets and finite automata from 1956.
In the present paper we tour a fragment of the literature and summarize results
on upper and lower bounds on the conversion of finite automata to regular
expressions and vice versa. We also briefly recall the known bounds for the
removal of spontaneous transitions (epsilon-transitions) on non-epsilon-free
nondeterministic devices. Moreover, we report on recent results on the average
case descriptional complexity bounds for the conversion of regular expressions
to finite automata and brand new developments on the state elimination
algorithm that converts finite automata to regular expressions.Comment: In Proceedings AFL 2014, arXiv:1405.527
Small Strong Epsilon Nets
Let P be a set of n points in . A point x is said to be a
centerpoint of P if x is contained in every convex object that contains more
than points of P. We call a point x a strong centerpoint for a
family of objects if is contained in every object that contains more than a constant fraction of points of P. A
strong centerpoint does not exist even for halfspaces in . We
prove that a strong centerpoint exists for axis-parallel boxes in
and give exact bounds. We then extend this to small strong
-nets in the plane and prove upper and lower bounds for
where is the family of axis-parallel
rectangles, halfspaces and disks. Here represents the
smallest real number in such that there exists an
-net of size i with respect to .Comment: 19 pages, 12 figure
On interference among moving sensors and related problems
We show that for any set of points moving along "simple" trajectories
(i.e., each coordinate is described with a polynomial of bounded degree) in
and any parameter , one can select a fixed non-empty
subset of the points of size , such that the Voronoi diagram of
this subset is "balanced" at any given time (i.e., it contains points
per cell). We also show that the bound is near optimal even for
the one dimensional case in which points move linearly in time. As
applications, we show that one can assign communication radii to the sensors of
a network of moving sensors so that at any given time their interference is
. We also show some results in kinetic approximate range
counting and kinetic discrepancy. In order to obtain these results, we extend
well-known results from -net theory to kinetic environments
Polychromatic Coloring for Half-Planes
We prove that for every integer , every finite set of points in the plane
can be -colored so that every half-plane that contains at least
points, also contains at least one point from every color class. We also show
that the bound is best possible. This improves the best previously known
lower and upper bounds of and respectively. We also show
that every finite set of half-planes can be colored so that if a point
belongs to a subset of at least of the half-planes then
contains a half-plane from every color class. This improves the best previously
known upper bound of . Another corollary of our first result is a new
proof of the existence of small size \eps-nets for points in the plane with
respect to half-planes.Comment: 11 pages, 5 figure
- …