The following pages link to (Q4179852):
Displaying 38 items.
- Pushdown tree automata, algebraic tree systems, and algebraic tree series (Q1854412) (← links)
- An operational and denotational approach to non-context-freeness (Q1870568) (← links)
- wMSO theories as grammar formalisms (Q1870569) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- Linear weighted tree automata with storage and inverse linear tree homomorphisms (Q2051842) (← links)
- The tree-generative capacity of combinatory categorial grammars (Q2051866) (← links)
- Deterministic top-down tree automata with Boolean deterministic look-ahead (Q2163373) (← links)
- On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees (Q2182712) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Hyper-optimization for deterministic tree automata (Q2344747) (← links)
- Characterizing weighted MSO for trees by branching transitive closure logics (Q2355685) (← links)
- Closure properties of linear context-free tree languages with an application to optimality theory (Q2368942) (← links)
- Fuzzy tree automata (Q2372277) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Generalising automaticity to modal properties of finite structures (Q2373714) (← links)
- Losing recognizability (Q2373716) (← links)
- A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead (Q2390283) (← links)
- Some decidability results on one-pass reductions (Q2423761) (← links)
- Efficient enumeration of weighted tree languages over the tropical semiring (Q2424678) (← links)
- Graph automata (Q2481961) (← links)
- Smoothing and compression with stochastic \(k\)-testable tree languages (Q2485083) (← links)
- Recursive self-organizing network models (Q2485230) (← links)
- Characterizing CTL-like logics on finite trees. (Q2490815) (← links)
- Cut sets as recognizable tree languages (Q2493984) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- Linear deterministic multi bottom-up tree transducers (Q2576876) (← links)
- Linking theorems for tree transducers (Q2628796) (← links)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- A Congruence-Based Perspective on Finite Tree Automata (Q5025071) (← links)
- Cascade Products and Temporal Logics on Finite Trees (Q5262961) (← links)
- Checking Emptiness of Non-Deterministic Regular Types with Set Operators (Q5415619) (← links)
- Tree Process Calculus (Q5415625) (← links)
- Alphabetic and synchronized tree transducers (Q5941078) (← links)
- Tree-based generation of languages of fractals (Q5958129) (← links)
- The regular viewpoint on PA-processes (Q5958465) (← links)
- On the Boolean Closure of Deterministic Top-Down Tree Automata (Q6154972) (← links)
