| other,17-4-J89-4003,ak | The model appears capable of accommodating the sort of <term> reduplications </term> that have been observed to occur in <term> natural languages </term> , but it excludes many of the unnatural constructions that other formal models have permitted . | #20171 The model appears capable of accommodating the sort of reduplications that have been observed to occur innatural languages, but it excludes many of the unnatural constructions that other formal models have permitted. | |
| other,15-1-J89-4003,ak | A model is presented to characterize the class of <term> languages </term> obtained by adding <term> reduplication </term> to <term> context-free languages </term> . | #20110 A model is presented to characterize the class of languages obtained by adding reduplication tocontext-free languages. | |
| other,16-3-J89-4003,ak | The class of <term> languages </term> generated is shown to lie strictly between the <term> context-free languages </term> and the <term> indexed languages </term> . | #20151 The class of languages generated is shown to lie strictly between the context-free languages and theindexed languages. | |
| other,12-3-J89-4003,ak | The class of <term> languages </term> generated is shown to lie strictly between the <term> context-free languages </term> and the <term> indexed languages </term> . | #20147 The class of languages generated is shown to lie strictly between thecontext-free languages and the indexed languages. | |
| tech,4-2-J89-4003,ak | The model is a <term> pushdown automaton </term> augmented with the ability to check <term> reduplication </term> by using the <term> stack </term> in a new way . | #20117 The model is apushdown automaton augmented with the ability to check reduplication by using the stack in a new way. | |
| other,12-2-J89-4003,ak | The model is a <term> pushdown automaton </term> augmented with the ability to check <term> reduplication </term> by using the <term> stack </term> in a new way . | #20125 The model is a pushdown automaton augmented with the ability to checkreduplication by using the stack in a new way. | |
| other,3-3-J89-4003,ak | The class of <term> languages </term> generated is shown to lie strictly between the <term> context-free languages </term> and the <term> indexed languages </term> . | #20138 The class oflanguages generated is shown to lie strictly between the context-free languages and the indexed languages. | |
| tech,16-2-J89-4003,ak | The model is a <term> pushdown automaton </term> augmented with the ability to check <term> reduplication </term> by using the <term> stack </term> in a new way . | #20129 The model is a pushdown automaton augmented with the ability to check reduplication by using thestack in a new way. | |
| other,9-1-J89-4003,ak | A model is presented to characterize the class of <term> languages </term> obtained by adding <term> reduplication </term> to <term> context-free languages </term> . | #20104 A model is presented to characterize the class oflanguages obtained by adding reduplication to context-free languages. | |
| other,9-4-J89-4003,ak | The model appears capable of accommodating the sort of <term> reduplications </term> that have been observed to occur in <term> natural languages </term> , but it excludes many of the unnatural constructions that other formal models have permitted . | #20163 The model appears capable of accommodating the sort ofreduplications that have been observed to occur in natural languages, but it excludes many of the unnatural constructions that other formal models have permitted. | |
| other,13-1-J89-4003,ak | A model is presented to characterize the class of <term> languages </term> obtained by adding <term> reduplication </term> to <term> context-free languages </term> . | #20108 A model is presented to characterize the class of languages obtained by addingreduplication to context-free languages. |
