Distance desert automata and the star height problem
Dresden University of Technology, Institute of Algebra, 01062 Dresden, Germany; email@example.com
We introduce the notion of nested distance desert automata as a joint generalization of distance automata and desert automata. We show that limitedness of nested distance desert automata is PSPACE-complete. As an application, we show that it is decidable in 22O(n) space whether the language accepted by an n-state non-deterministic automaton is of a star height less than a given integer h (concerning rational expressions with union, concatenation and iteration), which is the first ever complexity bound for the star height problem.
The OpenURL standard is a protocol for transmission of metadata describing the resource that you wish to access.
An OpenURL link contains article metadata and directs it to the
OpenURL server of your choice. The OpenURL server can provide access
to the resource and also offer complementary services (specific
search engine, export of references...). The OpenURL link can be
generated by different means.
If your librarian has set up your subscription with an
OpenURL resolver, OpenURL links appear automatically on the abstract pages.
You can define your own OpenURL resolver with your
In this case your choice will be given priority over that of your library.
You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see
You should disable this module if you wish to use the OpenURL server that you or your library have defined.