16
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Automata, Languages and Programming 

      Languages, Rewriting Systems, and Verification of Infinite-State Systems

      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 references28

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

          Unreliable Channels Are Easier to Verify Than Perfect Channels

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

            Polynomial closure and unambiguous product

            J. Pin, P. Weil (1997)
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              On the regular structure of prefix rewriting

                Bookmark

                Author and book information

                Book Chapter
                2001
                July 4 2001
                : 24-39
                10.1007/3-540-48224-5_3
                37bb4e5d-8e52-40c9-9a19-df7138b045be
                History

                Comments

                Comment on this book

                Book chapters

                Similar content4,886

                Cited by4