Part of the Lecture Notes in Computer Science book series (LNCS, volume 71)
Representing complexity classes by equality sets
KeywordsTuring Machine Time Bound Sive Function Phrase Structure Grammar Equality Language
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.R. Book, Polynomial space and transitive closure, SIAM J. Computing, to appear.Google Scholar
- 2.K. Culik II, A purely homomorphic characterization of recursively enumerable sets, J. Assoc. Comput. Mach., to appear.Google Scholar
- 3.K. Culik II, On homomorphic characterization of families of languages, unpublished manuscript.Google Scholar
- 4.K. Culik II and H.A. Maurer, On simple representations of language families, RAIRO — Informatique Theorique, to appear.Google Scholar
- 5.J. Engelfriet and G. Rozenberg, Fixed point languages, equality languages, and representation of recursively enumerable languages, J. Assoc. Comput. Mach., to appear. An extended abstract appears in the Proceedings of the 19th IEEE Symposium on Foundations of Computer Science (1978), 123–126.Google Scholar
- 6.J. Hopcroft and J. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.Google Scholar
- 7.A. Salomaa, Equality sets for homomorphisms of free monoids, Acta Cybernetica, to appear.Google Scholar
- 8.R. Smullyan, Theory of Formal Systems, Annals of Mathematics Studies, No. 47, Princeton University Press, 1961.Google Scholar
- 9.R. Stearns, J. Hartmanis and P. Lewis, Hierarchies for memory limited computations, Conference Record 6th IEEE Symp. on Switching Circuit Theory and Logical Design (1965), 179–190.Google Scholar
- 10.C. Wrathall, Remarks on languages and relations, in preparation.Google Scholar
© Springer-Verlag Berlin Heidelberg 1979