Ashok K. Chandra
STOC 1974
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.
Ashok K. Chandra
STOC 1974
Alok Aggarwal, Ashok K. Chandra, et al.
Theoretical Computer Science
Alok Aggarwal, Ashok K. Chandra
STOC 1988
Ashok K. Chandra, Prabhakar Raghavan, et al.
Computational Complexity