GUItar and FAgoo: Graphical interface for automata visualization, editing, and interaction
暂无分享,去创建一个
[1] Susan H. Rodger,et al. JFLAP: An Interactive Formal Languages and Automata Package , 2006 .
[2] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.
[3] Petra Mutzel,et al. An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm , 1993 .
[4] János Pach,et al. How to draw a planar graph on a grid , 1990, Comb..
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] G. Kant. Algorithms for drawing planar graphs , 1993 .
[7] 室 章治郎. Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .
[8] Nelma Moreira,et al. XML description for automata manipulations , 2010 .
[9] Robert F. Cohen,et al. Validating Graph Drawing Aesthetics , 1995, GD.
[10] David S. Johnson,et al. Crossing Number is NP-Complete , 1983 .