The following pages link to Mappings and grammars on trees (Q5603192):
Displayed 50 items.
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations (Q557898) (← links)
- Basic tree transducers (Q579951) (← links)
- Branching synchronization grammars with nested tables (Q596320) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q671682) (← links)
- Deterministic top-down tree transducers with iterated look-ahead (Q673068) (← links)
- Modular tree transducers (Q807012) (← links)
- A complete classification of deterministic root-to-frontier tree transformation classes (Q807029) (← links)
- Linearity and nondeletion on monadic context-free tree grammars (Q835003) (← links)
- Compositions of tree series transformations (Q860891) (← links)
- Deaccumulation techniques for improving provability (Q882487) (← links)
- A complete rewriting system for a monoid of tree transformation classes (Q918216) (← links)
- Compositions of extended top-down tree transducers (Q948090) (← links)
- Second-order abstract categorial grammars as hyperedge replacement grammars (Q972434) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Extended multi bottom-up tree transducers (Q1038420) (← links)
- Tree pushdown automata (Q1058866) (← links)
- Macro tree transducers (Q1073576) (← links)
- Pushdown machines for the macro tree transducer (Q1089810) (← links)
- High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
- Designing equivalent semantic models for process creation (Q1107305) (← links)
- Deterministic tree pushdown automata and monadic tree rewriting systems (Q1118421) (← links)
- Compositions with superlinear deterministic top-down tree transformations (Q1127541) (← links)
- Tree transducers, L systems, and two-way machines (Q1136239) (← links)
- Interdependent translation schemes (Q1151758) (← links)
- The formal power of one-visit attribute grammars (Q1157968) (← links)
- Morphismes et bimorphismes d'arbres (Q1165018) (← links)
- Pebble machines and tree walking machines (Q1170037) (← links)
- Systolic trees and systolic language recognition by tree automata (Q1172401) (← links)
- Multidimensional trees (Q1178697) (← links)
- Top-down tree transducers with two-way tree walking look-ahead (Q1185007) (← links)
- Alphabetic tree relations (Q1193896) (← links)
- An implementation of syntax directed functional programming on nested- stack machines (Q1194207) (← links)
- Tree transducers with external functions (Q1208712) (← links)
- On procedures as open subroutines. II (Q1216944) (← links)
- Natural state transformations (Q1217073) (← links)
- Tree adjunct grammars (Q1225947) (← links)
- Un théorème de duplication pour les forets algébriques (Q1229588) (← links)
- Surface tree languages and parallel derivation trees (Q1233730) (← links)
- Intercalation lemmas for tree transducer languages (Q1237574) (← links)
- Augmented transition networks and their relation to tree transducers (Q1238432) (← links)
- A generalized approach to formal languages (Q1239608) (← links)
- Un théorème de Chomsky-Schützenberger pour les forets algébriques (Q1240569) (← links)
- IO and OI. I (Q1241985) (← links)
- IO and OI. II (Q1243578) (← links)
- On tree transducers for partial functions (Q1247295) (← links)
- Classes of formal grammars (Q1248342) (← links)
- Pumping lemmas for term languages (Q1250713) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- On the equivalence problem for letter-to-letter top-down tree transducers (Q1275081) (← links)
