Preview
Unable to display preview. Download preview PDF.
References
R. Book, Polynomial space and transitive closure, SIAM J. Computing, to appear.
K. Culik II, A purely homomorphic characterization of recursively enumerable sets, J. Assoc. Comput. Mach., to appear.
K. Culik II, On homomorphic characterization of families of languages, unpublished manuscript.
K. Culik II and H.A. Maurer, On simple representations of language families, RAIRO — Informatique Theorique, to appear.
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.
J. Hopcroft and J. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.
A. Salomaa, Equality sets for homomorphisms of free monoids, Acta Cybernetica, to appear.
R. Smullyan, Theory of Formal Systems, Annals of Mathematics Studies, No. 47, Princeton University Press, 1961.
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.
C. Wrathall, Remarks on languages and relations, in preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Book, R.V., Brandenburg, FJ. (1979). Representing complexity classes by equality sets. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_5
Download citation
DOI: https://doi.org/10.1007/3-540-09510-1_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09510-1
Online ISBN: 978-3-540-35168-9
eBook Packages: Springer Book Archive