𝔖 Bobbio Scriptorium

✦ LIBER ✦

Regular Languages are Testable with a Constant Number of Queries

✍ Scribed by Alon, Noga; Krivelevich, Michael; Newman, Ilan; Szegedy, Mario

Book ID: 118177303
Publisher: Society for Industrial and Applied Mathematics
Year: 2001
Tongue: English
Weight: 248 KB
Volume: 30
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539700366528

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the number of queries needed t

A note on the number of queries needed to identify regular languages

✍ Dana Angluin 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 564 KB

Regular Languages Defined by Generalized

Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables

✍ Straubing; Thérien 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 251 KB

Tape complexity of languages which are r

Tape complexity of languages which are recognized by two-way push-down automata with a finite number of turns

✍ A. S. Barashko 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 525 KB

Abstracts in reproductive immunology: Us

Abstracts in reproductive immunology: Using EMBASE Excerpta Medica Database, we reproduce here a number of recent abstracts published elsewhere that are highly relevant to experimental and clinical reproductive immunobiology. This service id intended to provide the readers of the Journal of Reproductive Immunology with selected views of topical work, but it is not practical to aim for a complete coverage. A regular update of selected ‘hot abstracts in reproductive immunology’ will be published in further issues.

📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 66 KB