Pages that link to "Item:Q1854333"
From MaRDI portal
The following pages link to Sequentiality, monadic second-order logic and tree automata. (Q1854333):
Displaying 10 items.
- A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems (Q613611) (← links)
- Linear algebra for tensor problems (Q841137) (← links)
- Strong and NV-sequentiality of constructor systems (Q1029079) (← links)
- Decidability for left-linear growing term rewriting systems. (Q1400714) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- Certifying proofs in the first-order theory of rewriting (Q2233502) (← links)
- (Q2980977) (← links)
- Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting (Q5164173) (← links)
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification (Q6103588) (← links)
