Conference paper
Efficient compilation of linear recursive programs
Ashok K. Chandra
SWAT 1973
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
SWAT 1973
C.K. Wong, Ashok K. Chandra
Journal of the ACM
Ashok K. Chandra, David Harel
FOCS 1980
Ashok K. Chandra, Prabhakar Raghavan, et al.
Computational Complexity