12
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Language and Automata Theory and Applications 

      Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity

      other
      , ,
      Springer International Publishing

      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 references12

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

          Ordering by Divisibility in Abstract Algebras

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

            On the Reachability Analysis of Acyclic Networks of Pushdown Systems

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

              Effective constructions in well-partially- ordered free monoids

                Bookmark

                Author and book information

                Book Chapter
                2015
                February 24 2015
                : 473-485
                10.1007/978-3-319-15579-1_37
                7e15d58b-4d9b-4a07-9418-c078c585dc74
                History

                Comments

                Comment on this book

                Book chapters

                Similar content3,481

                Cited by2