𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Locally testable semigroups

✍ Scribed by Yechezkel Zalcstein

Book ID
110560148
Publisher
Springer
Year
1972
Tongue
English
Weight
535 KB
Volume
5
Category
Article
ISSN
0037-1912

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Locally testable languages
Locally testable languages
✍ Yechezkel Zalcstein πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 877 KB

This paper studies the locally testable languages (or "events") introduced by McNaughton and Papert. We characterize these languages by means of their syntactic semigroups and obtain wreath product and direct product decompositions for these semigroups. As a by-product of our study, we find an algeb

Bilateral locally testable languages
Bilateral locally testable languages
✍ Pedro GarcΔ±́a; JosΓ© Ruiz; Manuel Vazquez de Parga πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 218 KB

We give an algebraic characterization of a new variety of languages that will be called bilateral locally testable languages and denoted as BLT. Given k ΒΏ 0, the membership of a word x to a BLT (k-BT) language can be decided by means of exploring the segments of length k of x, as well as considering

Locally testable cyclic codes
Locally testable cyclic codes
✍ Babai, L.; Shpilka, A.; Stefankovic, D. πŸ“‚ Article πŸ“… 2005 πŸ› IEEE 🌐 English βš– 360 KB
Families of locally testable languages
Families of locally testable languages
✍ Pascal Caron πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 177 KB

## Kim, McNaughton and McCloskey have produced a polynomial time algorithm in order to test if a deterministic automaton recognizes a locally testable language. We provide a characterization in terms of automata for the strictly locally testable languages and for the strongly locally testable lang