Ashok K. Chandra, Lawrence T. Kou, et al.
Acta Informatica
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, Lawrence T. Kou, et al.
Acta Informatica
Ashok K. Chandra
POPL 1981
Ashok K. Chandra
STOC 1974
Ashok K. Chandra, Prabhakar Raghavan, et al.
Computational Complexity