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