Peg-Solitaire, String Rewriting Systems and Finite Automata
暂无分享,去创建一个
[1] Michael Frazier,et al. Prefix Grammars: An Alternative Characterization of the Regular Languages , 1994, Inf. Process. Lett..
[2] Michael R. Fellows,et al. Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.
[3] Jeffrey D. Ullman,et al. A programming and problem solving seminar. , 1991 .
[4] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[5] Ryuhei Uehara,et al. Generalized Hi-Q is NP-complete , 1990 .
[6] Klaus Sutner,et al. Linear cellular automata and the garden-of-eden , 1989 .