Journal of Logic, Language and Information

, Volume 17, Issue 2, pp 233–236

Book Review

Book Review
  • 119 Downloads

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barwise, J., & Etchemendy, J. (1995). Turing’s World 3.0. Stanford, CA: Center for the study of Language and Information Publications.Google Scholar
  2. Hopcroft, J. E., & Ullman, J. D. (1979). Introduction to automata theory, languages, and computation. Reading, MA: Addison-Wesley Publishing Co..Google Scholar
  3. Hopcroft, J. E., & Ullman, J. D. (2007). Introduction to automata theory, languages, and computation. Boston, MA: Pearson/Addison Wesley.Google Scholar
  4. Khoussainov, B., & Nerode, A. (2001). Automata theory and its applications. Boston, MA: Birkhäuser Boston Inc.Google Scholar
  5. Kozen D.C. (1997). Automata and computability. New York, SpringerGoogle Scholar
  6. Kropf T. (1999). Introduction to formal hardware verification. Berlin, SpringerGoogle Scholar
  7. Moss L.S., Tiede H.-J. (2006). Applications of modal logic in linguistics. In: Blackburn P., van Benthem J., Wolter F(eds) Handbook of modal logic. Amsterdam, ElsevierGoogle Scholar
  8. Rogers J. (1998). A descriptive approach to language-theoretic complexity. Stanford, CA: CSLI PublicationsGoogle Scholar
  9. Rosser J.B. (1984). Highlights of the history of the lambda-calculus. Annals of the History of Computing 6(4): 337–349CrossRefGoogle Scholar
  10. Sipser M. (2006). Introduction to the theory of computation (2nd ed). Boston, MA: Thomson Course Technology.Google Scholar

Copyright information

© Springer Science+Business Media 2007

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceIllinois Wesleyan UniversityBloomingtonUSA

Personalised recommendations