"Presburger Arithmetic and Recognizability of Sets of Natural Numbers by ..."

Christian Michaux, Roger Villemaire (1996)

> Home

Details and statistics

DOI: 10.1016/0168-0072(95)00022-4

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/apal/MichauxV96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apal/MichauxV96
Christian Michaux, Roger Villemaire:
Presburger Arithmetic and Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems. Ann. Pure Appl. Log. 77(3): 251-277 (1996)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.