This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Book, R.V., Greibach, S.A. Quasi-realtime languages, Mathematical Systems Theory 4 (1970), 97–111.
Hibbard, T.N. A generalization of context-free determinism, Information and Control 11 (1967), 196–238.
Lewis II, P.M., Stearns, R.E., Hartmanis, J. Memory bounds for the recognition of contextfree and contextsensitive languages, IEEE Conf.Rec. on Switching Circuit Theory and Logical Design (1965), 191–202.
Karp, R.M. Reducibilities among combinatorial problems, in: Miller & Thatcher: Complexity of computer computations, New York 1972, 85–104.
Savitch, W.J. Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences 4 (1970), 177–192.
Springsteel, F.N. On the pre-AFL of logn space and related families of languages, Theoretical Computer Science 2 (1976), 295–304.
Wechsung, G. Komplexitätstheoretische Charakterisierung der kontextfreien und linearen Sprachen, Elektronische Informationsverarbeitung und Kybernetik 12 (1976), 289–300.
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
von Braunmühl, B., Verbeek, R. (1979). Finite-change automata. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-09118-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09118-9
Online ISBN: 978-3-540-35517-5
eBook Packages: Springer Book Archive