For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
22
views
7
references
 Top references
cited by
13
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      6,403
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Article: not found

      Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems

      Author(s): ,
      Publication date Created:
      Publication date (Print):
      Journal: Annals of Pure and Applied Logic
      Publisher: 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 references7

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

          Weak Second-Order Arithmetic and Finite Automata

          J. Büchi (1960)
          Article 0 comments Cited 99 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            On the base-dependence of sets of numbers recognizable by finite automata

            Alan Cobham (1969)
            Article 0 comments Cited 55 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Presburgerness of predicates regular in two number systems

              A. L. Semenov (1977)
              Article 0 comments Cited 12 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and article information

                Journal
                Title: Annals of Pure and Applied Logic
                Abbreviated Title: Annals of Pure and Applied Logic
                Publisher: Elsevier BV
                ISSN (Print): 01680072
                Publication date Created: February 1996
                Publication date (Print): February 1996
                Volume: 77
                Issue: 3
                Pages: 251-277
                Article
                DOI: 10.1016/0168-0072(95)00022-4
                SO-VID: 3083281e-ec7d-4a33-8a18-400491d61625
                Copyright © © 1996
                License:

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

                History

                Data availability:

                Comments

                Comment on this article