The following pages link to (Q3323279):
Displaying 50 items.
- Domains of partial attributed tree transducers (Q294731) (← links)
- Forward and backward application of symbolic tree transducers (Q404011) (← links)
- Loops and overloops for tree-walking automata (Q442148) (← links)
- Symbolic tree automata (Q483051) (← links)
- Continuous monoids and semirings (Q596031) (← links)
- Branching synchronization grammars with nested tables (Q596320) (← links)
- Another variation on the common subexpression problem (Q685700) (← links)
- A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
- On Müller context-free grammars (Q764314) (← links)
- Compositions of constant weighted extended tree transducers (Q832923) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- Complementing deterministic tree-walking automata (Q845667) (← links)
- A descriptive characterisation of linear languages (Q851197) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems (Q918215) (← links)
- Alternating tree automata (Q1077932) (← links)
- High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
- On a representation of tree automata (Q1098636) (← links)
- Gaifman's theorem on categorial grammars revisited (Q1115429) (← 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)
- Recognizable formal series on trees and cofree coalgebraic systems (Q1295934) (← links)
- On two families of forests (Q1323385) (← links)
- Finite tree automata with cost functions (Q1325851) (← links)
- Tree automata for code selection (Q1342507) (← links)
- Stochastically costed tree automata: Turakainen's theorem (Q1351787) (← links)
- Positive tree representations and applications to tree automata (Q1383144) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- Intersection of finitely generated congruences over term algebra (Q1399965) (← links)
- Decision procedures for inductive Boolean functions based on alternating automata (Q1399969) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- Decidability for left-linear growing term rewriting systems. (Q1400714) (← links)
- Term rewriting restricted to ground terms. (Q1401322) (← links)
- A gap property of deterministic tree languages. (Q1401364) (← links)
- Shape preserving top-down tree transducers. (Q1401405) (← links)
- On ground tree transformations and congruences induced by tree automata. (Q1401416) (← links)
- Model building with ordered resolution: Extracting models from saturated clause sets (Q1404975) (← links)
- A property of left-linear rewrite systems preserving recognizability (Q1575563) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Interconvertibility of a class of set constraints and context-free-language reachability (Q1583350) (← links)
- Restricted ground tree transducers (Q1589437) (← links)
- Re-describing an algorithm by Hopcroft (Q1589443) (← links)
- Recognizable tree-languages and nonlinear morphisms (Q1603692) (← 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)
- Coding tree languages based on lattice-valued logic (Q1701899) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Shuffles of trees (Q1750210) (← links)
- Multitree automata that count (Q1770418) (← links)
