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

      The complementation problem for Büchi automata with applications to temporal logic

      , ,
      Theoretical Computer Science
      Elsevier BV

      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.

          Abstract

          Related collections

          Most cited references9

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

          Finite Automata and Their Decision Problems

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

            The complexity of propositional linear temporal logics

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

              Temporal logic can be more expressive

                Bookmark

                Author and article information

                Journal
                Theoretical Computer Science
                Theoretical Computer Science
                Elsevier BV
                03043975
                1987
                1987
                : 49
                : 2-3
                : 217-237
                Article
                10.1016/0304-3975(87)90008-9
                e4fd0516-045c-44a4-86ad-f947ace9b50f
                © 1987

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article