We consider the number of parallel derivation steps as complexity measure for context-free languages and show that a strict and dense hierarchy is obtained between logarithmic and linear (arbitrary) tree height. We hereby improve a result of Gabarro. Furthermore we give a non-regular language with logarithmic tree height disproving a conjecture of Culik and Maurer. As a new method we use counter- representations, where the successor relation can be handled as the complement of context-free languages.
CITATION STYLE
Reinhardt, K. (1999). A parallel context-free derivation hierarchy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1684, pp. 441–450). Springer Verlag. https://doi.org/10.1007/3-540-48321-7_37
Mendeley helps you to discover research relevant for your work.