22
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Mathematical Foundations of Computer Science 2014 

      Tight Bounds for Complementing Parity Automata

      other
      ,
      Springer Berlin Heidelberg

      Read this book at

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

          Related collections

          Most cited references17

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

          Finite Automata and Their Decision Problems

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

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

              Bookmark
              • Record: found
              • Abstract: not found
              • Book: not found

              Computer-Aided Verification of Coordinating Processes

                Bookmark

                Author and book information

                Book Chapter
                2014
                : 499-510
                10.1007/978-3-662-44522-8_42
                3d7eb8fa-474a-4866-9f71-fcec5b017c6b
                History

                Comments

                Comment on this book

                Book chapters

                Similar content1,457