25
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      The state complexities of some basic operations on regular languages

      , ,
      Theoretical Computer Science
      Elsevier BV

      Read this article at

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

          Abstract

          Related collections

          Most cited references5

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

          Alternation

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

            Succinct representation of regular languages by boolean automata

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

              Constructions for alternating finite automata∗

                Bookmark

                Author and article information

                Journal
                Theoretical Computer Science
                Theoretical Computer Science
                Elsevier BV
                03043975
                March 1994
                March 1994
                : 125
                : 2
                : 315-328
                Article
                10.1016/0304-3975(92)00011-F
                29394aad-0f5b-4215-b234-df9c4c57c876
                © 1994

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article