𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Locally linear families of languages

✍ Scribed by Andries P.J. van der Walt

Book ID
114037198
Publisher
Elsevier Science
Year
1976
Weight
240 KB
Volume
32
Category
Article
ISSN
0019-9958

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A note on 1-locally linear languages
A note on 1-locally linear languages
✍ J.M. Autebert; L. Boasson; G. Cousineau πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science βš– 134 KB
McNaughton families of languages
McNaughton families of languages
✍ M. Beaudry; M. Holzer; G. Niemann; F. Otto πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 410 KB

In 1988 the Church-Rosser languages were introduced by McNaughton et al. as those languages that are recognized by ΓΏnite, length-reducing and con uent string-rewriting systems using extra non-terminal symbols. Here we generalize this concept by considering classes of languages that are obtained by o