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

      Synchronized rational relations of finite and infinite words

      ,
      Theoretical Computer Science
      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 references11

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

          Finite Automata and Their Decision Problems

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

            Topology of finite graphs

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

              Decision problems forω-automata

                Bookmark

                Author and article information

                Journal
                Theoretical Computer Science
                Theoretical Computer Science
                Elsevier BV
                03043975
                February 1993
                February 1993
                : 108
                : 1
                : 45-82
                Article
                10.1016/0304-3975(93)90230-Q
                96d14c06-1f1e-445d-bf22-7b6500266f3c
                © 1993

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

                History

                Comments

                Comment on this article