19
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Highly Undecidable Problems For Infinite Computations

      RAIRO - Theoretical Informatics and Applications
      EDP Sciences

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references21

          • Record: found
          • Abstract: not found
          • Article: not found

          Decision problems forω-automata

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Synchronized rational relations of finite and infinite words

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              X-automata on ω-words

                Bookmark

                Author and article information

                Journal
                RAIRO - Theoretical Informatics and Applications
                RAIRO-Theor. Inf. Appl.
                EDP Sciences
                0988-3754
                1290-385X
                April 2009
                February 14 2009
                April 2009
                : 43
                : 2
                : 339-364
                Article
                10.1051/ita/2009001
                68a994a5-0267-4fbe-8d6c-5f389ea275a3
                © 2009
                History

                Comments

                Comment on this article