On Emptiness and Counting for Alternating Finite Automata
暂无分享,去创建一个
[1] Tao Jiang,et al. A Note on the Space Complexity of Some Decision Problems for Finite Automata , 1991, Inf. Process. Lett..
[2] Neil D. Jones,et al. Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..
[3] Peter Rossmanith,et al. The Emptiness Problem for Intersections of Regular Languages , 1992, MFCS.
[4] Klaus-Jörn Lange,et al. A further link between formal languages and complexity theory , 1987, Bull. EATCS.
[5] Carme Àlvarez,et al. A very hard log space counting class , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.