SIGACT News - researchr journal

13	--	14	David Maier 0001. Review of "Introduction to automata theory, languages and computation" by John E. Hopcroft and Jeffrey D. Ullman. Addison-Wesley 1979
14	--	16	John C. Cherniavsky. Review of "Checking Landau's "Grundlagen" in the Automath system" by L. S. Van Benthem Jutting. Mathematical Centre 1979.: "First order dynamic logic" by David Harel. Springer-Verlag 1979. And "A programming logic" by Robert L. Constable and Michael J. O'Donnell. Winthrop Publishers 1978
36	--	44	Jon Louis Bentley, Dorothea Haken, James B. Saxe. A general method for solving divide-and-conquer recurrences
45	--	51	Haim Gaifman, Eli Shamir 0001. Roots of the hardest context free language and other constructs
52	--	65	George Gens, Eugene Levner. Complexity of approximation algorithms for combinatorial problems: a survey
66	--	67	Allan Gottlieb, Clyde P. Kruskal. A note on sorting integers from a bounded range
68	--	80	David Harel. On folk theorems
81	--	87	Ernst L. Leiss. Constructing a finite automaton for a given regular expression
88	--	89	Farshid Nourani. A note on the constructors of the computable universe
90	--	95	António Porto, Armando B. Matos. Ackermann and the superpowers

135

External Links