## References

Davis M., Sigal R., Weyuker E.J. (1994). *Computability, Complexity, and Languages:
Fundamentals of Theoretical Computer Science* (2nd Edn). Academic Press.

Eitan G (1989). *An Introduction to the Theory of Computation*. Computer Science Press.

Harrison M.A. (1978). *Introduction to Formal Language Theory*. Addison-Wesley.

Hein J.L. (1996). *Theory of Computation.* Sudbury, MA: Jones & Bartlett.

Hopcroft J.E., Rajeev M., Ullman J.D. (2000). *Introduction to Automata Theory, Languages, and Computation *(2nd Edn). Pearson Education.

Hopcroft J.E., Ullman J.D. (2006). *Introduction to Automata Theory, Languages, and
Computation *(3rd Edn). Reading, MA: Addison-Wesley.

Lewis F.D. (2007). *Essentials of Theoretical Computer Science.*

Schmeiser J.P., Barnard D.T. (1995). *Producing a Top-Down Parse Order with Bottom-Up
Parsing*. North-Holland: Elsevier.

Sipser M. (1997). Part One: Automata and Languages, Chapters 1–2, pp.29–122. Section 4.1: Decidable Languages, pp.152–159. Section 5.1: Undecidable Problems from Language Theory, pp.172–183. In: *Introduction to the Theory of Computation*. PWS Publishing.

Sipser M. (2006). *Introduction to the Theory of Computation *(2 Edn). PWS Publishing.

Taylor R.G. (1998). *Models of Computation and Formal Languages.* New York: Oxford

University Press.