𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Splicing in abstract families of languages

✍ Scribed by Dennis Pixton

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
240 KB
Volume
234
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Splicing representations of strictly loc
Splicing representations of strictly locally testable languages
✍ Tom Head πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 711 KB

The relationship between the family SH of simple splicing languages, which was recently introduced by Mateescu et al. and the family X7' of strictly locally testable languages is clarified by establishing an ascending hierarchy of families {SiH: i > -1) of splicing languages for which SH = SI H and

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

Closures which preserve finiteness in fa
Closures which preserve finiteness in families of languages
✍ Gene F. Rose πŸ“‚ Article πŸ“… 1968 πŸ› Elsevier Science 🌐 English βš– 808 KB

Each set of operations selected from union, intersection, complement, star, quotients, derivatives, word-reversal, and homomorphisms is investigated with respect to its closure of an arbitrary family of word-sets, as well as to its closure of an arbitrary family of regular languages. Certain sets ar