The following pages link to Zoltán Fülöp (Q404009):
Displayed 50 items.
- (Q235194) (redirect page) (← links)
- Domains of partial attributed tree transducers (Q294731) (← links)
- Forward and backward application of symbolic tree transducers (Q404011) (← links)
- Composition closure of linear extended top-down tree transducers (Q519891) (← links)
- Equational tree transformations (Q551198) (← links)
- Varieties of recognizable tree series over fields (Q627171) (← links)
- A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
- Equational weighted tree transformations (Q766185) (← links)
- A complete classification of deterministic root-to-frontier tree transformation classes (Q807029) (← 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)
- A characterization of attributed tree transformations by a subclass of macro tree transducers (Q1125799) (← links)
- Compositions with superlinear deterministic top-down tree transformations (Q1127541) (← links)
- A complete description for a monoid of deterministic bottom-up tree transformation classes (Q1177164) (← links)
- Tree transducers with external functions (Q1208712) (← links)
- On injectivity of deterministic top-down tree transducers (Q1313742) (← links)
- Undecidable properties of deterministic top-down tree transducers (Q1341717) (← links)
- A note on the equivalence problem of \(E\)-patterns (Q1351579) (← links)
- Shape preserving top-down tree transducers. (Q1401405) (← links)
- Tree series transformations that respect copying (Q1405790) (← links)
- Restricted ground tree transducers (Q1589437) (← links)
- Iterated relabeling tree transducers (Q1605311) (← links)
- Characterizations of recognizable weighted tree languages by logic and bimorphisms (Q1797776) (← links)
- Top-down tree transducers with deterministic top-down look-ahead (Q1825674) (← links)
- Hierarchies of tree series transformations (Q1826640) (← links)
- Attributed tree transducers cannot induce all deterministic bottom-up tree transformations (Q1891149) (← links)
- Minimal equational representations of recognizable tree languages (Q1901719) (← links)
- Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable (Q2040408) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
- Rational weighted tree languages with storage and the Kleene-Goldstine theorem (Q2175416) (← links)
- Composition closure of linear weighted extended top-down tree transducers (Q2177605) (← links)
- A Kleene theorem for weighted tree automata over distributive multioperator monoids (Q2272217) (← links)
- A Kleene theorem for weighted tree automata over tree valuation monoids (Q2280327) (← links)
- Characterizing weighted MSO for trees by branching transitive closure logics (Q2355685) (← links)
- A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead (Q2390283) (← links)
- Weighted iterated linear control (Q2422779) (← links)
- Linear deterministic multi bottom-up tree transducers (Q2576876) (← links)
- Linking theorems for tree transducers (Q2628796) (← links)
- (Q2731276) (← links)
- A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids (Q2798741) (← links)
- Local Weighted Tree Languages (Q2803054) (← links)
- (Q2882382) (← links)
- (Q3028362) (← links)
- (Q3077186) (← links)
- Equational Weighted Tree Transformations with Discounting (Q3098036) (← links)
- (Q3150247) (← links)
- (Q3431475) (← links)
- (Q3468622) (← links)
- (Q3485880) (← links)