Conference paper
Horn clauses and the fixpoint query hierarchy
Ashok K. Chandra, David Harel
SIGMOD/PODS 1982
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
SIGMOD/PODS 1982
Ashok K. Chandra, D.S. Hirschberg, et al.
Theoretical Computer Science
Ashok K. Chandra, Larry J. Stockmeyer
FOCS 1976
Ashok K. Chandra, David Harel
STOC 1979