Abstract
First S-questionnaires are introduced as mechanical devices which permit the representation of recursively definable families of information structures by means of sets of sequences of non-negative integers. The subclass of L-questionnaires is then defined enabling: i) a bijection between such a family F and the set ℕ of non-negative integers ii) the construction of an operator admitting exactly the elements of F as its fixed-points. Two examples are treated extensively.
The research reported here was supported by the C.N.R., under contract n. 72.000246.42 of the Special Program for Informatica.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Böhm — "Structure informative e loro trasformazioni", Atti del III Seminario sul Trattamento Automatico delle Informazioni, Istituto Matematico U. Dini, Firenze (1972), 1–37.
C. Böhm and S. Ronchi della Rocca — "Numbering methods of finite sets and multisets through trees", Communication of ACM Symposium, Venice (1972), 516–524.
C. Böhm and M. Dezani-Ciancaglini — "Listing the functional digraph structures", Proc. International Computing Symposium 1973, A. Günther ed., Amsterdam (1974), 33–39.
W. S. Brainerd — "Three Generating Regular Systems", Information and Control, vol. 14, n. 2, (1969), 217–231.
D.E. Knuth — "The Art of Computer Programming", Vol. 2, Seminumerical Algorithms, Addison-Wesley, Menlo Park (1971), 398–422.
C. Picard — "Théorie des questionnaires", Gauthier-Villars, Paris (1965), Ch. 5.
J.R.Shoenfield — "Degrees of Unsolvability", North-Holland Mathem. Studies 2, Amsterdam (1971), 1–11.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Böhm, C., Dezani-Ciancaglini, M., Ronchi Della Rocca, S. (1974). Listing of information structures defined by fixed-point operators. In: Robinet, B. (eds) Programming Symposium. Lecture Notes in Computer Science, vol 19. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06859-7_139
Download citation
DOI: https://doi.org/10.1007/3-540-06859-7_139
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06859-4
Online ISBN: 978-3-540-37819-8
eBook Packages: Springer Book Archive