Pages that link to "Item:Q1325836"

The following pages link to Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836):

Displaying 18 items.

• Reachability analysis over term rewriting systems (Q556686) (← links)
• Descendants of a recognizable tree language for sets of linear monadic term rewrite rules (Q845695) (← links)
• Normalization properties for shallow TRS and innermost rewriting (Q964737) (← links)
• Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
• Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
• Decidability for left-linear growing term rewriting systems. (Q1400714) (← links)
• Term rewriting restricted to ground terms. (Q1401322) (← 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)
• Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
• Derivation trees of ground term rewriting systems. (Q1854289) (← links)
• Right-linear half-monadic term rewrite systems (Q1884902) (← links)
• Losing recognizability (Q2373716) (← links)
• One-variable context-free hedge automata (Q2424690) (← links)
• The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)
• RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION (Q5249028) (← links)
• Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5894255) (← links)