BibTeX
CSL-JSON
MLA
Harvard
Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$
release_koehhopovnae7dyvcpvdyq4bgm
by
Amitabha Roy, Howard Straubing
Published
in SIAM journal on computing (Print) by Society for Industrial & Applied Mathematics (SIAM).
2007 Volume 37, p502-521
Archived Files and Locations
application/pdf 228.7 kB
file_ny6krn3csfgmnml5ozfg2n4zba
|
web.archive.org (webarchive) web.archive.org (webarchive) www.cs.bc.edu (web) |
Read Archived PDF
Preserved and Accessible
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar