Pages that link to "Item:Q5565119"

The following pages link to Indexed Grammars—An Extension of Context-Free Grammars (Q5565119):

Displaying 50 items.

• The grammar of mammalian brain capacity (Q290555) (← links)
• The generative capacity of block-synchronized context-free grammars (Q557813) (← links)
• Basic tree transducers (Q579951) (← links)
• Look-ahead on pushdowns (Q579952) (← links)
• A shrinking lemma for indexed languages (Q671370) (← links)
• A new pumping lemma for indexed languages, with an application to infinite words (Q729820) (← links)
• Linear indexed languages (Q797293) (← links)
• Decidability of structural equivalence of E0L grammars (Q807023) (← links)
• On the rational subset problem for groups. (Q875109) (← links)
• Fundamental methodological issues of syntactic pattern recognition (Q903109) (← links)
• Two complementary operations inspired by the DNA hairpin formation: Completion and reduction (Q1004085) (← links)
• Hierarchies of hyper-AFLs (Q1058860) (← links)
• Extended macro grammars and stack controlled machines (Q1064075) (← links)
• Pushdown machines for the macro tree transducer (Q1089810) (← links)
• Grammars, derivation modes and properties of indexed and type-0 languages (Q1098316) (← links)
• Self-embedding indexed grammars (Q1099639) (← links)
• The OI-hierarchy is closed under control (Q1109578) (← links)
• Deterministic tree pushdown automata and monadic tree rewriting systems (Q1118421) (← links)
• The IO- and OI-hierarchies (Q1161273) (← links)
• Multidimensional trees (Q1178697) (← links)
• Iterated stack automata and complexity classes (Q1183602) (← links)
• A geometric hierarchy beyond context-free languages (Q1200806) (← links)
• On procedures as open subroutines. II (Q1216944) (← links)
• On grammar forms with terminal context (Q1219689) (← links)
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem (Q1222965) (← links)
• A note on K-iteration grammars (Q1223940) (← links)
• Tree adjunct grammars (Q1225947) (← links)
• Two-way nested stack automata are equivalent to two-way stack automata (Q1227452) (← links)
• Un théorème de duplication pour les forets algébriques (Q1229588) (← links)
• A relationship between ETOL and EDTOL languages (Q1231392) (← links)
• Hypergrammars: An extension of macrogrammars (Q1234592) (← links)
• Degree-languages: A new concept of acceptance (Q1236888) (← links)
• Augmented transition networks and their relation to tree transducers (Q1238432) (← links)
• A pattern representation of indexed languages (Q1238636) (← links)
• Effective constructions in well-partially-ordered free monoids (Q1249047) (← links)
• Pumping lemmas for term languages (Q1250713) (← links)
• Deterministic acceptors for indexed languages (Q1280912) (← links)
• On two families of forests (Q1323385) (← links)
• On two-way tree automata (Q1327293) (← links)
• Transducers and the decidability of independence in free monoids (Q1341744) (← links)
• Yield-languages of two-way pushdown tree automata (Q1352013) (← links)
• Recognition of perfect labeled trees with regularity condition (Q1364096) (← links)
• The complexity of verbal languages over groups (Q1713480) (← links)
• Global index grammars and descriptive power (Q1770832) (← links)
• Grammatical characterizations of NPDAs and VPDAs with counters (Q1784750) (← links)
• The calculi of emergence: Computation, dynamics and induction (Q1817022) (← links)
• Theory of formal grammars (Q1846334) (← links)
• Pushdown tree automata, algebraic tree systems, and algebraic tree series (Q1854412) (← links)
• Counting with range concatenation grammars (Q1870577) (← links)
• Boolean grammars (Q1886037) (← links)