Pages that link to "Item:Q1901719"
From MaRDI portal
The following pages link to Minimal equational representations of recognizable tree languages (Q1901719):
Displaying 11 items.
- Deterministic bottom-up tree transducers and ground term rewrite systems (Q1019744) (← links)
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language (Q1261478) (← links)
- Intersection of finitely generated congruences over term algebra (Q1399965) (← links)
- Term rewriting restricted to ground terms. (Q1401322) (← links)
- On ground tree transformations and congruences induced by tree automata. (Q1401416) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- Restricted ground tree transducers (Q1589437) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- A note on the minimalization of tree-automata (Q4029594) (← links)
- (Q4381396) (← links)
- MINIMAL RECOGNIZERS AND SYNTACTIC MONOIDS OF DR TREE LANGUAGES (Q5053730) (← links)