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

      Efficient Separability of Regular Languages by Subsequences and Suffixes

      other

      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 references18

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

          Ordering by Divisibility in Abstract Algebras

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

            The Complexity of Some Problems on Subsequences and Supersequences

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

              nSPARQL: A navigational language for RDF

                Bookmark

                Author and book information

                Book Chapter
                2013
                : 150-161
                10.1007/978-3-642-39212-2_16
                9e75a74b-9f68-4797-841b-532c903e3392
                History

                Comments

                Comment on this book

                Book chapters

                Similar content2,696

                Cited by9