K.-J. Lange and P. Rossmanith. The emptiness problem for intersections of regular languages. In Proceedings of the 17th Conference on Mathematical Foundations of Computer Science, number 629 in LNCS, pages 346--354. Springer, 1992. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
On Emptiness and Counting for Alternating Finite Automata.. - Holzer (Correct)
....problem to, e.g. intersection emptiness, or restrict it to, e.g. alternating finite automata where every state is deterministic except for one state which is universal. A problem closely connected with emptiness is the so called short word problem which was investigated by Lange and Rossmanith [4]. For both deterministic and nondeterministic finite automata this problem can be used to characterize classes of bounded nondeterminism. The main idea underlying short words is that in general the shortest word accepted of an alternating finite automaton Partially supported by Deutsche ....
K.-J. Lange and P. Rossmanith. The emptiness problem for intersections of regular languages. In Proceedings of the 17th Conference on Mathematical Foundations of Computer Science, number 629 in LNCS, pages 346--354. Springer, 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC