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
C.K. Wong, Ashok K. Chandra
Journal of the ACM
Gregory J. Chaitin, Marc A. Auslander, et al.
Computer Languages
Ashok K. Chandra
STOC 1974