Elementary bounded languages

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

Leftmove-bounded picture languages

✍ Changwook Kim; Ivan Hal Sudborough 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 134 KB

Let = {u; d; r; l} be the chain-code picture alphabet such that u (d; r; l) denotes the graphics command to move the drawing pen up (down, right, left) in the 2D Cartesian plane. It is known that the picture membership problem can be solved in polynomial time for each context-free language over {u;

Uniformly bounded duplication languages

✍ Peter Leupold; Carlos Martín-Vide; Victor Mitrana 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 197 KB

On Bounded Rational Trace Languages

✍ Christian Choffrut; Flavio D’Alessandro; Stefano Varricchio 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 464 KB

Bounded repairability of word languages

✍ Benedikt, Michael; Puppis, Gabriele; Riveros, Cristian 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 408 KB