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

      A Greibach normal form for context-free graph grammars

      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 references20

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

          The monadic second-order logic of graphs. I. Recognizable sets of finite graphs

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

            Transductions and Context-Free Languages

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

              A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

                Bookmark

                Author and book information

                Book Chapter
                1992
                June 2 2005
                : 138-149
                10.1007/3-540-55719-9_70
                04195d31-1a65-4a1e-9b47-5a74d8b8a390
                History

                Comments

                Comment on this book

                Book chapters

                Similar content2,601

                Cited by3