The following pages link to Sándor Vágvölgyi (Q389935):
Displaying 50 items.
- Tree shuffle (Q389936) (← links)
- Symbol different term rewrite systems (Q492918) (← links)
- Deterministic top-down tree transducers with iterated look-ahead (Q673068) (← links)
- Storage-to-tree transducers with look-ahead (Q706619) (← links)
- CHAP and rewrite components (Q766175) (← links)
- (Q807028) (redirect page) (← links)
- A complete classification of deterministic root-to-frontier tree transformation classes (Q807029) (← links)
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules (Q845695) (← links)
- A complete rewriting system for a monoid of tree transformation classes (Q918216) (← links)
- The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations (Q918726) (← links)
- Murg term rewrite systems (Q975468) (← links)
- Deterministic bottom-up tree transducers and ground term rewrite systems (Q1019744) (← links)
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
- Top-down tree transducers with two-way tree walking look-ahead (Q1185007) (← links)
- Tree transducers with external functions (Q1208712) (← links)
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language (Q1261478) (← links)
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836) (← links)
- Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations (Q1351783) (← 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)
- A property of left-linear rewrite systems preserving recognizability (Q1575563) (← links)
- Restricted ground tree transducers (Q1589437) (← links)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems (Q1707978) (← links)
- Top-down tree transducers with deterministic top-down look-ahead (Q1825674) (← links)
- Right-linear half-monadic term rewrite systems (Q1884902) (← links)
- Attributed tree transducers cannot induce all deterministic bottom-up tree transformations (Q1891149) (← links)
- Minimal equational representations of recognizable tree languages (Q1901719) (← links)
- Rewriting preserving recognizability of finite tree languages (Q1936231) (← links)
- Deterministic top-down tree automata with Boolean deterministic look-ahead (Q2163373) (← links)
- Losing recognizability (Q2373716) (← links)
- Some decidability results on one-pass reductions (Q2423761) (← links)
- (Q2753653) (← links)
- On Ground Word Problem of Term Equation Systems (Q2803061) (← links)
- One-Pass Reductions (Q2820785) (← links)
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES (Q3021987) (← links)
- (Q3026371) (← links)
- (Q3028362) (← links)
- (Q3395997) (← links)
- Congruences Generated by Extended Ground Term Rewrite Systems (Q3400560) (← links)
- (Q3468622) (← links)
- (Q3485880) (← links)
- (Q3490951) (← links)
- (Q3655368) (← links)
- (Q3779776) (← links)
- (Q3813315) (← links)
- (Q3832055) (← links)
- Variants of top-down tree transducers with look-ahead (Q3832064) (← links)
