The following pages link to Zoltán Fülöp (Q404009):
Displaying 32 items.
- (Q3490951) (← links)
- (Q3601401) (← links)
- DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA (Q3634180) (← links)
- (Q3655364) (← links)
- (Q3779776) (← links)
- (Q3813315) (← links)
- (Q3832055) (← links)
- Variants of top-down tree transducers with look-ahead (Q3832064) (← links)
- (Q3925893) (← links)
- (Q3974865) (← links)
- (Q4005178) (← links)
- (Q4210160) (← links)
- (Q4269134) (← links)
- (Q4273673) (← links)
- (Q4529619) (← links)
- (Q4560250) (← links)
- Weighted Languages Recognizable by Weighted Tree Automata (Q4584658) (← links)
- In Memoriam Zoltán Ésik (1951–2016) (Q4605507) (← links)
- (Q4654640) (← links)
- (Q4747517) (← links)
- Superlinear deterministic top-down tree transducers (Q4895817) (← links)
- (Q4939196) (← links)
- Crisp-determinization of weighted tree automata over strong bimonoids (Q5038197) (← links)
- Weighted Tree Automata and Tree Transducers (Q5072551) (← links)
- (Q5286134) (← links)
- Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers (Q5300844) (← links)
- Minimization of Deterministic Top-down Tree Automata (Q5350163) (← links)
- Circularity, composition, and decomposition results for pebble macro tree transducers (Q5503438) (← links)
- The component hierarchy of chain-free cooperating distributed regular tree grammars (Q5958121) (← links)
- Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata (Q6072403) (← links)
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)
- Rational weighted tree languages with storage (Q6647747) (← links)
