Author:
Ibarra Oscar H.,McQuillan Ian
Publisher
Springer International Publishing
Reference15 articles.
1. Ginsburg, S., Greibach, S., Harrison, M.: Stack automata and compiling. J. ACM 14(1), 172–201 (1967)
2. Gurari, E.M., Ibarra, O.H.: The complexity of decision problems for finite-turn multicounter machines. J. Comput. Syst. Sci. 22(2), 220–229 (1981)
3. Lecture Notes in Computer Science;M Hague,2011
4. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
5. Hunt, H.B.: On the time and tape complexity of languages i. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, STOC 1973, pp. 10–19 (1973)