<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>
handle: 11311/658368
Summary: Multi-depth grammars were introduced for describing some non-context free features of programming languages. They generate a hierarchy of languages, have intesting closure properties, are simpler than other grammar formalisms and have a very natural accepting device, called multi-pushdown automaton. In the past, various formalisms extending context-free grammars have proved equivalent to tree adjoining grammars (tag), introduced by computational linguists to model natural languages. In this paper we show that the class of languages generated by tag is strictly included in the family generated by multi-depth grammars, and it is exactly the minimum full super-AFL including the family generated by multi-depth grammars of order 2.
multi-depth grammars, Formal languages and automata, tree adjoining grammars
multi-depth grammars, Formal languages and automata, tree adjoining grammars
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |