Problem Solving in Automata, Languages, and Complexity

References

Aho, A., Hopcroft, J. and Ullman, J. (1974) The Design and AnaZysis of
Computer Algorithms, Addison-Wesley, Reading, MA,

Balcazar, J. L., Diaz, J. and Gabarro, J. (1988) Structural Cmnplexity I,
Springer-Verlag, Berlin, Germany.

Balcazar, J. L., Diaz, J. and Gabarro, J. (1990) Structural Cmnplexity II,
Springer-Verlag, Berlin, Germany.

Cohen, D. I. A. (1997) Introduction to Computer Theory (2nd edition), John
Wiley & Sons, New York.

Cook, S. (1971), Th e complexity of theorem-proving procedures, Proceedings
of the 3rd ACM Symposium on Theory of Computing, Association for
Computing Machinery, New York, pp. 151-158.

Davis, M. D., Sigal, R. and Weyuker, E. J. (1994) Computability, Complexity,
and Languages, Academic Press, San Diego.
Du, D.-Z. and Ko, K. (2000), Theory of Computational Complexity, John
Wiley & Sons, New York.
Floyd R. W. and Beigel, R. (1994) The Language of Machines, Computer
Science Press, New York.
Garey, M. R. and Johnson, D. (1979) Computers and Intractability, a Guide
to the Theory of NP-Completeness, W.H. Freeman, San Francisco.
Ginzburg, A. (1968) Algebraic Theory of Automata, Academic Press, New
York.
Hartmanis, J. (1976) F easible Computations and Provable CompZexity Prop-
erties, SIAM, Philadelphia.
Hopcroft, J. and Ullman, J. (1979) Introduction to Automata Theory, Lan-
guages, and Computation, Addison-Wesley, Reading, MA.
387

Problem Solving in Automata, Languages, and Complexity.

Ding-Zhu Du, Ker-I Ko

Copyright2001 by John Wiley & Sons, Inc.

ISBNs: 0-471-43960-6 (Hardback); 0-471-22464-2 (Electronic)