ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
21
views
7
references
Top references
cited by
13
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,800
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):
Christian Michaux
,
Roger Villemaire
Publication date
Created:
February 1996
Publication date
(Print):
February 1996
Journal:
Annals of Pure and Applied Logic
Publisher:
Elsevier BV
Read this article at
ScienceOpen
Publisher
Review
Review article
Invite someone to review
Bookmark
Cite as...
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
Radiology and Natural Language Processing
Most cited references
7
Record
: found
Abstract
: not found
Article
: not found
Weak Second-Order Arithmetic and Finite Automata
J. Büchi
(1960)
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)
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)
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
Sign in to comment
scite_
Similar content
5,800
Cobham DS1563 Datasheet
Authors:
Meggitt acquires Cobham's composites businesses
Authors:
Cobham's theorem for substitutions
Authors:
Fabien Durand
See all similar
Cited by
13
Presburger sets and p-minimal fields
Authors:
Raf Cluckers
The definable criterion for definability in Presburger arithmetic and its applications
Authors:
An.A. Muchnik
Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
Authors:
Alexis Bès
See all cited by
Most referenced authors
17
A. Semenov
D. Perrin
A. V. Semenov
See all reference authors