Conference paper
Structure and complexity of relational queries
Ashok K. Chandra, David Harel
FOCS 1980
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, David Harel
FOCS 1980
Ashok K. Chandra, Steven Fortune, et al.
Journal of Computer and System Sciences
Ashok K. Chandra
POPL 1981
Manuel Blum, Ashok K. Chandra, et al.
Information Processing Letters