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

      Separating Regular Languages by Piecewise Testable and Unambiguous Languages

      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 references16

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

          On finite monoids having only trivial subgroups

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

            Piecewise testable events

            Imre Simon (1975)
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Factorization forests of finite height

              Imre Simon (1990)
                Bookmark

                Author and book information

                Book Chapter
                2013
                : 729-740
                10.1007/978-3-642-40313-2_64
                4bd2f771-e62d-49bd-ab99-07acdc6c954c
                History

                Comments

                Comment on this book

                Book chapters

                Similar content4,443

                Cited by6