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

      A Fragment of ML Decidable by Visibly Pushdown Automata

      other

      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 references13

          • Record: found
          • Abstract: not found
          • Conference Proceedings: not found

          Visibly pushdown languages

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

            Call-by-value games

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

              Deciding Equivalence of Finite Tree Automata

                Bookmark

                Author and book information

                Book Chapter
                2011
                : 149-161
                10.1007/978-3-642-22012-8_11
                17d7b242-f5f8-4964-bc79-ebca9f1e05da

                http://www.springer.com/tdm

                History

                Comments

                Comment on this book

                Book chapters

                Similar content2,185

                Cited by5