Ashok K. Chandra, Philip M. Merlin
STOC 1977
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, Philip M. Merlin
STOC 1977
Ashok K. Chandra
STOC 1974
Gregory J. Chaitin, Marc A. Auslander, et al.
Computer Languages
Ashok K. Chandra
POPL 1981