 | 2010 |
|---|
| 50 |       | Manfred Droste,
Torsten Stüber,
Heiko Vogler:
Weighted finite automata over strong bimonoids.
Inf. Sci. 180(1): 156-166 (2010) |
| 2009 |
|---|
| 49 | | Johanna Högberg,
Andreas Maletti,
Heiko Vogler:
Bisimulation Minimisation of Weighted Automata on Unranked Trees.
Fundam. Inform. 92(1-2): 103-130 (2009) |
| 48 | | Torsten Stüber,
Heiko Vogler,
Zoltán Fülöp:
Decomposition of Weighted multioperator Tree Automata.
Int. J. Found. Comput. Sci. 20(2): 221-245 (2009) |
| 47 | | Zoltán Fülöp,
Andreas Maletti,
Heiko Vogler:
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids.
Theory Comput. Syst. 44(3): 455-499 (2009) |
| 2008 |
|---|
| 46 | | Branimir Seselja,
Andreja Tepavcevic,
Heiko Vogler:
A note on cut-worthiness of recognizable tree series.
Fuzzy Sets and Systems 159(22): 3087-3090 (2008) |
| 45 | | Manfred Droste,
Jacques Sakarovitch,
Heiko Vogler:
Weighted automata with discounting.
Inf. Process. Lett. 108(1): 23-28 (2008) |
| 44 | | Torsten Stüber,
Heiko Vogler:
Weighted monadic datalog.
Theor. Comput. Sci. 403(2-3): 221-238 (2008) |
| 2007 |
|---|
| 43 |  | Frank Drewes,
Heiko Vogler:
Learning Deterministically Recognizable Tree Series.
Journal of Automata, Languages and Combinatorics 12(3): 332-354 (2007) |
| 2006 |
|---|
| 42 | | Björn Borchardt,
Andreas Maletti,
Branimir Seselja,
Andreja Tepavcevic,
Heiko Vogler:
Cut sets as recognizable tree languages.
Fuzzy Sets and Systems 157(11): 1560-1571 (2006) |
| 41 | | Manfred Droste,
Heiko Vogler:
Weighted tree automata and weighted logics.
Theor. Comput. Sci. 366(3): 228-247 (2006) |
| 2005 |
|---|
| 40 | | Andreas Maletti,
Heiko Vogler:
Incomparability Results for Classes of Polynomial Tree Series Transformations.
Journal of Automata, Languages and Combinatorics 10(4): 535-568 (2005) |
| 39 | | Zoltán Fülöp,
Armin Kühnemann,
Heiko Vogler:
Linear deterministic multi bottom-up tree transducers.
Theor. Comput. Sci. 347(1-2): 276-287 (2005) |
| 38 | | Manfred Droste,
Christian Pech,
Heiko Vogler:
A Kleene Theorem for Weighted Tree Automata.
Theory Comput. Syst. 38(1): 1-38 (2005) |
| 2004 |
|---|
| 37 | | Reinhard Pöschel,
Alexander Semigrodskikh,
Heiko Vogler:
Relationally defined clones of tree functions closed under selection or primitive recursion.
Acta Cybern. 16(3): 411-425 (2004) |
| 36 | | Zoltán Fülöp,
Armin Kühnemann,
Heiko Vogler:
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead.
Inf. Process. Lett. 91(2): 57-67 (2004) |
| 35 | | Zoltán Fülöp,
Heiko Vogler:
Weighted Tree Transducers.
Journal of Automata, Languages and Combinatorics 9(1): 31-54 (2004) |
| 34 | | Claus Jürgensen,
Heiko Vogler:
Syntactic composition of top-down tree transducers is short cut fusion.
Mathematical Structures in Computer Science 14(2): 215-282 (2004) |
| 33 | | Zoltán Fülöp,
Zsolt Gazdag,
Heiko Vogler:
Hierarchies of tree series transformations.
Theor. Comput. Sci. 314(3): 387-429 (2004) |
| 2003 |
|---|
| 32 | | Manfred Droste,
Heiko Vogler:
Editorial.
Journal of Automata, Languages and Combinatorics 8(2): 115 (2003) |
| 31 | | Björn Borchardt,
Heiko Vogler:
Determinization of Finite State Weighted Tree Automata.
Journal of Automata, Languages and Combinatorics 8(3): 417-463 (2003) |
| 30 | | Zoltán Fülöp,
Heiko Vogler:
Tree Series Transformations that Respect Copying.
Theory Comput. Syst. 36(3): 247-293 (2003) |
| 2002 |
|---|
| 29 | | Joost Engelfriet,
Zoltán Fülöp,
Heiko Vogler:
Bottom-Up and Top-Down Tree Series Transformations.
Journal of Automata, Languages and Combinatorics 7(1): 11-70 (2002) |
| 2001 |
|---|
| 28 | | Thomas Noll,
Heiko Vogler:
The Universality of Higher-Order Attributed Tree Transducers.
Theory Comput. Syst. 34(1): 45-75 (2001) |
| 1999 |
|---|
| 27 | | Zoltán Fülöp,
Heiko Vogler:
A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers.
Theory Comput. Syst. 32(6): 649-676 (1999) |
| 1998 |
|---|
| 26 | | Joost Engelfriet,
Heiko Vogler:
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers.
J. Comput. Syst. Sci. 56(3): 332-356 (1998) |
| 25 | | Sebastian Maneth,
Heiko Vogler:
Attributed Context-Free Hypergraph Grammars.
Journal of Automata, Languages and Combinatorics 3(2): 105-147 (1998) |
| 1997 |
|---|
| 24 | | Andrea Mößle,
Heiko Vogler:
Benefits of Hypergraphs for Program Transformation.
GI Jahrestagung 1997: 572-581 |
| 1996 |
|---|
| 23 | | Heinz Faßbender,
Andrea Mößle,
Heiko Vogler:
Implementation of a Deterministic Partial E-Unification Algorithm for Macro Tree Transducers.
Journal of Functional and Logic Programming 1996(2): (1996) |
| 1994 |
|---|
| 22 | | Heinz Faßbender,
Heiko Vogler:
A Universal Unification Algorithm Based on Unification-Driven Leftmost Outermost Narrowing.
Acta Cybern. 11(3): 139-168 (1994) |
| 21 | | Armin Kühnemann,
Heiko Vogler:
A Pumping Lemma for Output Languages of Attributed Tree Transducers.
Acta Cybern. 11(4): 261-306 (1994) |
| 20 | | Armin Kühnemann,
Heiko Vogler:
Synthesized and Inherited Functions. A new Computational Model for Syntax-Directed Semantic.
Acta Inf. 31(5): 431-477 (1994) |
| 19 | | Thomas Noll,
Heiko Vogler:
Top-down Parsing with Simultaneous Evaluation of Noncircular Attribute Grammars.
Fundam. Inform. 20(4): 285-332 (1994) |
| 18 | | Joost Engelfriet,
Heiko Vogler:
The Translation Power of Top-Down Tree-to-Graph Transducers.
J. Comput. Syst. Sci. 49(2): 258-305 (1994) |
| 1993 |
|---|
| 17 | | Zoltán Fülöp,
Frank Herrmann,
Sándor Vágvölgyi,
Heiko Vogler:
Tree Transducers with External Functions.
Theor. Comput. Sci. 108(2): 185-236 (1993) |
| 1992 |
|---|
| 16 | | Heinz Faßbender,
Heiko Vogler:
An Implementation of Syntax Directed Functional Programming on Nested-Stack Machines.
Formal Asp. Comput. 4(4): 341-375 (1992) |
| 1991 |
|---|
| 15 | | Heiko Vogler:
Functional Description of the Contextual Analysis in Block-Structured Programming Languages: A Sase Study of Tree Transducers.
Sci. Comput. Program. 16(3): 251-275 (1991) |
| 14 | | Joost Engelfriet,
Heiko Vogler:
Modular Tree Transducers.
Theor. Comput. Sci. 78(2): 267-303 (1991) |
| 1988 |
|---|
| 13 | | Joost Engelfriet,
Heiko Vogler:
High Level Tree Transducers and Iterated Pushdown Tree Transducers.
Acta Inf. 26(1/2): 131-192 (1988) |
| 12 | | Heiko Vogler:
The OI-Hierarchy Is Closed under Control
Inf. Comput. 78(3): 187-204 (1988) |
| 1987 |
|---|
| 11 | | Joost Engelfriet,
Heiko Vogler:
Look-Ahead on Pushdowns
Inf. Comput. 73(3): 245-279 (1987) |
| 10 | | Heiko Vogler:
Basic Tree Transducers.
J. Comput. Syst. Sci. 34(1): 87-128 (1987) |
| 1986 |
|---|
| 9 | | Heiko Vogler:
Basic Tree Transducers.
CAAP 1986: 183-195 |
| 8 | | Heiko Vogler:
The OI-Hierarchy is Closed under Control.
MFCS 1986: 611-619 |
| 7 | | Heiko Vogler:
Iterated Linear Control and Iterated One-Turn Pushdowns.
Mathematical Systems Theory 19(2): 117-133 (1986) |
| 6 | | Joost Engelfriet,
Heiko Vogler:
Pushdown Machines for the Macro Tree Transducer.
Theor. Comput. Sci. 42: 251-368 (1986) |
| 5 | | Joost Engelfriet,
Heiko Vogler:
Corrigenda: Pushdown Machines for the Macro Tree Tranducer.
Theor. Comput. Sci. 48(3): 339 (1986) |
| 1985 |
|---|
| 4 | | Heiko Vogler:
Iterated linear control and iterated one-turn pushdowns.
FCT 1985: 474-483 |
| 3 | | Joost Engelfriet,
Heiko Vogler:
Characterization of High Level Tree Transducers.
ICALP 1985: 171-178 |
| 2 | | Joost Engelfriet,
Heiko Vogler:
Macro Tree Transducers.
J. Comput. Syst. Sci. 31(1): 71-146 (1985) |
| 1984 |
|---|
| 1 | | Joost Engelfriet,
Heiko Vogler:
Regular Characterizations of Macro Tree Transducers.
CAAP 1984: 103-118 |
