✦ LIBER ✦

Disjunctive decomposition of languages

✍ Scribed by Y.Q. Guo; G.W. Xu; G. Thierrin

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 282 KB
Volume: 46
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90020-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Language-theoretic complexity of disjunc

Language-theoretic complexity of disjunctive sequences

✍ Cristian Calude; Yu Sheng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 438 KB

A sequence over an alphabet Z is called disjunctirr if it contains all possible finite strings over .Z as its substrings. Disjunctive sequences have been recently studied in various contexts. They abound in both category and measure senses. In this paper we measure the complexity of a sequence x by

Regular component decomposition of regul

Regular component decomposition of regular languages

✍ Y.J. Liu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 198 KB

A language is regular if it can be recognized by a ÿnite automaton. According to the pumping lemma, every inÿnite regular language contains a regular subset of the form uv + w, where u; v; w are words and v is not empty. It is known that every regular language can be expressed as ( i∈I uiv + i wi) ∪

A Generic Disjunctive/Conjunctive Decomp

A Generic Disjunctive/Conjunctive Decomposition Model forn-ary Relations

✍ Iwin Leenen; Iven Van Mechelen; Paul De Boeck 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 201 KB

This paper discusses a generic decomposition model that represents an arbitrary n-ary relation as a disjunctive or conjunctive combination of a number of n-ary component relations of a prespecified type. An important subclass of order-preserving decompositions is defined and its properties are deriv

Generalisations of disjunctive sequences

✍ Cristian S. Calude; Ludwig Staiger 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

The present paper proposes a generalisation of the notion of disjunctive (or rich) sequence, that is, of an infinite sequence of letters having each finite sequence as a subword. Our aim is to give a reasonable notion of disjunctiveness relative to a given set of sequences F . We show that a definit

A study of disjunctive reasoning

✍ J. St. B. T. Evans; S. E. Newstead 📂 Article 📅 1980 🏛 Guilford Publishing Inc 🌐 English ⚖ 913 KB

Biosystematics of widely disjunctive tax

Biosystematics of widely disjunctive taxa

✍ Askell Löve; Doris Löve 📂 Article 📅 1967 🏛 Springer 🌐 English ⚖ 595 KB