No label defined (Q3751038)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3988741
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3988741

      Statements

      0 references
      1986
      0 references
      initial words
      0 references
      omega languages
      0 references
      omega computations
      0 references
      Turing machines
      0 references
      arithmetical and analytical hierarchies
      0 references
      [For the entire collection see Zbl 0592.00028.] Turing machines with \(\omega\)-computations are mechanisms that accept sets of infinite words, \(\omega\)-languages. In this paper, the author investigates the properties of sets of finite words (languages) accepted by Turing machines with \(\omega\)-computations. A characterization theory of these languages via arithmetical and analytical hierarchies is proved and some properties of sets of words obtained as prefixes of \(\omega\)- words are studied.
      0 references

      Identifiers