✦ LIBER ✦

Uniformly bounded duplication languages

✍ Scribed by Peter Leupold; Carlos Martín-Vide; Victor Mitrana

Book ID: 108112497
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 197 KB
Volume: 146
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.10.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The length sets of D0L languages are uni

The length sets of D0L languages are uniformly bounded

✍ K.P. Lee; G. Rozenberg 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 525 KB

Uniformly hard languages

✍ Rod Downey; Lance Fortnow 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 163 KB

Ladner (J. Assoc. Comput. Mach. 22 (1975) 155) showed that there are no minimal recursive sets under polynomial-time reductions. Given any recursive set A, Ladner constructs a set B such that B strictly reduces to A but B does not lie in P. The set B does have very long sequences of input lengths of

Elementary bounded languages

✍ Sorin Istrail 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 492 KB

Uniformly Bounded Representations of Gro

Uniformly Bounded Representations of Groups

✍ L. Ehrenpreis and F. I. Mautner 📂 Article 📅 1955 🏛 National Academy of Sciences 🌐 English ⚖ 134 KB

Substitution and bounded languages

✍ Jonathan Goldstine 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 952 KB

necessarily context-free) bounded languages by full AFL operations, or from any set of' bounded context-free languages by full AFL operations and substitution.

Left-derivation bounded languages

✍ S.J. Walljasper 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 331 KB

Left-derivation bounded languages are defined as those languages defined from context-free grammars by placing a bound on the number of nonterminals appearing in left-derivations. These languages are generated by left-derivation bounded grammars and form a full AFL not closed under reversal. The lef