Manuel Blum, Ashok K. Chandra, et al.
Information Processing Letters
It is shown that for every finite-state automaton there exists an equivalent nondeterministic automaton with a planar state graph. However there exist finite-state automata with no equivalent deterministic automaton with a planar state graph. © 1976 Springer-Verlag.
Manuel Blum, Ashok K. Chandra, et al.
Information Processing Letters
Ashok K. Chandra, Prabhakar Raghavan, et al.
Computational Complexity
Ashok K. Chandra
SIGMOD/PODS/ 1988
Alok Aggarwal, Ashok K. Chandra, et al.
SPAA 1989