We prove that the shortest word accepted by an n-state intersection selective nondeterministic automaton with nonempty language can be of length O( e n log n).

Statecharts were developed by Harel et al [10] to specify complex reactive systems. In this paper we report on our application of statecharts as a design and specification tool for an X-Windows based Graphical User Interface ...