Abstract
In the early 60’s there was a surge of papers dealing with growth, self-reproduction, self-repair, etc., of automata. These notions were often discussed in the framework of the “classical” theory of automata, i.e. theory which deals with automata whose inputs and outputs are considered to be words over certain finite alphabet. In other cases, special frameworks for this purpose were created, namely tessalations, and many results were obtained in this way. However both these approaches had certain limitations and it is now apparent that a new, more general framework, is needed.
Chapter PDF
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rajlich, V. (1973). On oriented hypergraphs and on dynamics of some discrete systems. In: Brauer, W. (eds) GI Gesellschaft für Informatik e. V.. Lecture Notes in Computer Science, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-41148-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-41148-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-40668-7
Online ISBN: 978-3-662-41148-3
eBook Packages: Springer Book Archive