Sang Cho

According to our database, Sang Cho authored at least 5 papers between 1988 and 1992.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1992

The Parallel Complexity of Finite-State Automata Problems

Sang Cho, Dung T. Huynh

Inf. Comput., March, 1992

The Parallel Complexity of Coarsest Set Partition Problems.

Sang Cho, Dung T. Huynh

Inf. Process. Lett., 1992

1991

Finite-Automaton Aperiodicity is PSPACE-Complete.

Sang Cho, Dung T. Huynh

Theor. Comput. Sci., 1991

1990

The complexity of membership for deterministic growing context-sensitive grammars.

Sang Cho, Dung T. Huynh

Int. J. Comput. Math., 1990

1988

On a Complexity Hierarchy Between L and NL.

Sang Cho, Dung T. Huynh

Inf. Process. Lett., 1988