12
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      STACS 2005 

      Regular Tree Languages Definable in FO

      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 references15

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

          On finite monoids having only trivial subgroups

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

            Weak Second-Order Arithmetic and Finite Automata

            J. Büchi (1960)
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Generalized finite automata theory with an application to a decision problem of second-order logic

                Bookmark

                Author and book information

                Book Chapter
                2005
                : 327-339
                10.1007/978-3-540-31856-9_27
                53c49b3c-aad5-4836-9e30-4b5a989f2182
                History

                Comments

                Comment on this book

                Book chapters

                Similar content1,451

                Cited by4