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

      An EILENBERG theorem for ∞-languages

      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 references2

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

          Factors of words

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

            On Recognizable Sets and Tree Automata

              Bookmark

              Author and book information

              Book Chapter
              1991
              June 8 2005
              : 588-599
              10.1007/3-540-54233-7_166
              9a886701-6e05-4742-9750-843cd6cb5fbb
              History

              Comments

              Comment on this book

              Book chapters

              Similar content1,639

              Cited by13