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

      Deterministic tree pushdown automata and monadic tree rewriting systems

      Journal of Computer and System Sciences
      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.

          Related collections

          Most cited references16

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

          Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

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

            Tree-Manipulating Systems and Church-Rosser Theorems

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

              Indexed Grammars---An Extension of Context-Free Grammars

                Bookmark

                Author and article information

                Journal
                Journal of Computer and System Sciences
                Journal of Computer and System Sciences
                Elsevier BV
                00220000
                December 1988
                December 1988
                : 37
                : 3
                : 367-394
                Article
                10.1016/0022-0000(88)90014-1
                716516bf-506b-48fc-9404-5b495a794b8e
                © 1988

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

                https://www.elsevier.com/open-access/userlicense/1.0/

                History

                Comments

                Comment on this article