The following pages link to (Q4179852):
Displaying 50 items.
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- Deterministic tree pushdown automata and monadic tree rewriting systems (Q1118421) (← links)
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
- The string generating power of context-free hypergraph grammars (Q1176107) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- A complete description for a monoid of deterministic bottom-up tree transformation classes (Q1177164) (← links)
- Quantaloidal nuclei, the syntactic congruence and tree automata (Q1184038) (← links)
- Top-down tree transducers with two-way tree walking look-ahead (Q1185007) (← links)
- Tree transducers with external functions (Q1208712) (← links)
- Computing with graph rewriting systems with priorities (Q1261464) (← links)
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language (Q1261478) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- General varieties of tree languages (Q1275067) (← links)
- On the equivalence problem for letter-to-letter top-down tree transducers (Q1275081) (← links)
- Nondeterministic operations on finite relational structures (Q1276248) (← links)
- On injectivity of deterministic top-down tree transducers (Q1313742) (← links)
- Synchronized tree automata (Q1325832) (← links)
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- Modulo-counting quantifiers over finite trees (Q1325850) (← links)
- Finite tree automata with cost functions (Q1325851) (← links)
- The inference of tree languages from finite samples: An algebraic approach (Q1329735) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- Undecidable properties of deterministic top-down tree transducers (Q1341717) (← links)
- Lower bounds on type checking overloading (Q1350740) (← links)
- Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations (Q1351783) (← links)
- The monadic second-order logic of graphs. X: Linear orderings (Q1366538) (← links)
- A theoretical foundation of the DSSSL location model (Q1370525) (← links)
- Unification of infinite sets of terms schematized by primal grammars (Q1392278) (← links)
- Criteria to disprove context freeness of collage languages. (Q1401171) (← links)
- On the power of tree-walking automata. (Q1401944) (← links)
- Series-parallel languages and the bounded-width property (Q1566734) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- A property of left-linear rewrite systems preserving recognizability (Q1575563) (← links)
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
- On the equivalence of the cube-product and the general product of automata (Q1575736) (← links)
- Tree-based picture generation (Q1583092) (← links)
- Iterated relabeling tree transducers (Q1605311) (← links)
- Decidability of EDT0L structural equivalence (Q1605312) (← links)
- Output string languages of compositions of deterministic macro tree transducers (Q1608323) (← links)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- Characterizations of complete residuated lattice-valued finite tree automata (Q1759726) (← links)
- A note on identities of two-dimensional languages (Q1765373) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Weak Muller acceptance conditions for tree automata (Q1770388) (← links)
- Uniform and nonuniform recognizability. (Q1853746) (← links)
- Derivation trees of ground term rewriting systems. (Q1854289) (← links)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
