Listing of information structures defined by fixed-point operators
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.
KeywordsTerminal Node Listing Method Tree Domain Minimum Positive Integer Level Identifier
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- W. S. Brainerd — "Three Generating Regular Systems", Information and Control, vol. 14, n. 2, (1969), 217–231.Google Scholar
- D.E. Knuth — "The Art of Computer Programming", Vol. 2, Seminumerical Algorithms, Addison-Wesley, Menlo Park (1971), 398–422.Google Scholar
- C. Picard — "Théorie des questionnaires", Gauthier-Villars, Paris (1965), Ch. 5.Google Scholar
- J.R.Shoenfield — "Degrees of Unsolvability", North-Holland Mathem. Studies 2, Amsterdam (1971), 1–11.Google Scholar