On derivation trees of indexed grammars - an extension of the uvwxy- theorem
From MaRDI portal
Publication:1222965
DOI10.2977/prims/1195192738zbMath0319.68043OpenAlexW2050169407MaRDI QIDQ1222965
Publication date: 1973
Published in: Publications of the Research Institute for Mathematical Sciences, Kyoto University (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2977/prims/1195192738
Related Items
On two-way tree automata, An Approach to Computing Downward Closures, Grammars, derivation modes and properties of indexed and type-0 languages, Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy, One-way weak-stack-counter automata, MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS, Unboundedness problems for machines with reversal-bounded counters, Word-mappings of level 2, On the structure of graphs in the Caucal hierarchy, Applications of L systems to group theory, A shrinking lemma for indexed languages, Complexity in left-associative grammar, Iterated pushdown automata and sequences of rational numbers, The computational power of parsing expression grammars, Intercalation lemmas for tree transducer languages, Augmented transition networks and their relation to tree transducers, A new pumping lemma for indexed languages, with an application to infinite words, Classes of formal grammars, Pumping lemmas for term languages, Unnamed Item, Decidability of the finiteness of ranges of tree transductions, Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered, Three hierarchies of transducers, COMBING NILPOTENT AND POLYCYCLIC GROUPS, Counting with range concatenation grammars
Cites Work
