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
Type  article-journal
Stage   published
Year   2007
Language   en ?
Journal Metadata
Not in DOAJ
In Keepers Registry
ISSN-L:  0097-5397
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: fc661926-e93c-492e-99cd-31127680c5b2
API URL: JSON