About the by codings of environments induced posets [µz, ≤] and [ℒz, ≤]

  • Chr. Meinel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /1/.
    Budach,L., Meinel,Chr.: “Environments and Automata”, EIK in print (1981)Google Scholar
  2. /2/.
    Budach,L., Meinel,Chr.: “Umwelten und Automaten in Umwelten”, Seminarberichte Sekt. Math. d. Humboldt-Univ., Nr.23, 1980Google Scholar
  3. /3/.
    Epstein, R.: “Degrees of Unsolvability: Structure and Theory”, LN in Math., Springer-Verl. Berlin Heidelberg New York 1979Google Scholar
  4. /4/.
    Hopcroft,J., Ullman,J.: Formal Languages and their Relation to Automata“, Addison-Wesley Publ.Comp. 1969Google Scholar
  5. /5/.
    Meinel,Chr.: “Embedding of the poset of degrees of unsolvability in the poset [µ, ≤] ”, EIK in print (1981)Google Scholar
  6. /6/.
    Meinel,Chr.: “On importance of plane labyrinths”, to appear in EIKGoogle Scholar
  7. /7/.
    Meinel, Chr.: “Über die durch Kodierungen induzierte Hierarchie von Umwelten und Labyrinthen”, Diss., Berlin 1981Google Scholar
  8. /8/.
    Rogers, H.: “Theory of recursive functions and effective computability”, McGraw-Hill, New York 1967Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Chr. Meinel
    • 1
  1. 1.Sektion MathematikHumboldt-UniversitätBerlin

Personalised recommendations