For advanced search options you can also view this in the Forschungsinformationssystem of the TU Dresden.

1 bis 17 von 17 Einträgen

Droste, Manfred (Hrsg.); Vogler, Heiko (Hrsg.): Selected Papers of the Workshop Weighted Automata: Theory and Applications (WATA 2004). Journal of Automata, Languages and Combinatorics 10, Nr. 2-3 (2005)

Borchardt, Björn; Fülöp, Zoltán; Gazdag, Zsolt; Maletti, Andreas: Bounds for tree automata with polynomial costs. In: Journal of Automata, Languages and Combinatorics 10 (2005), S. 107–157

Borchardt, Björn: Code Selection by Tree Series Transducers. In: 9th International Conference on Implementation and Application of Automata, CIAA'04, Kingston, Canada 3317 (2005), S. 57–67

Maletti, Andreas: The power of tree series transducers of type I and II. In: 9th International Conference on Developments in Language Theory, DLT 2005, Palermo, Italy 3572 (2005), S. 338–349

Maletti, A.: Compositions of bottom-up tree series transformations. In: Proceedings 11th International Conference on Automata and Formal Languages, University of Szeged (2005), S. 187–199

Maletti, A.: HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. In: Theoretical Computer Science (2005)

Maletti, A.; Vogler, H.: Incomparability Results for Classes of Polynomial Tree Series Transformations. In: Journal of Automata, Languages and Combinatorics (2005)

Maletti, A.: Compositions of Tree Series Transformations. In: Technical Report TUD-FI05-05 (2005)

Giesl, J.; Kühnemann, A.; Voigtländer, J.: Deaccumulation Techniques for Improving Provability. In: Technical Report TUD-FI05-14 (2005), S. 1–50

Droste, Manfred; Pech, Christian; Vogler, Heiko: A Kleene theorem for weighted tree automata. In: Theory Comput. Syst. 38 (2005), S. 1–38

Maletti, A.: Relating tree series transducers and weighted tree automata. In: International Journal of Foundations of Computer Science 16(4) (2005), S. 723–741

Johann, P.; Voigtländer, J.: The impact of seq on Free Theorems-Based Program Transformations. In: Fundamenta Informaticae (2005)

Voigtländer, J.: Formal Efficiency Analysis for Tree Transducer Composition. In: Theory of Computing Systems (2005)

Borchardt, B.; Maletti, A.; Seselja, B.; Tepavcevic, A.; Vogler, H.: Cut sets as Recognizable Tree Languages. In: Fuzzy Sets and Systems (2005)

Droste, M.; Vogler, H.: Recognizable and Rational Formal Power Series with General Discounting. In: Technical Report TUD-FI05-06 (2005)

Fülöp, Z.; Muzamel, L.: Decomposition Results for Pebble Macro Tree Transducers. In: Technical Report TUD-FI05-13 (2005), S. 1–41

Fülöp, Z.; Kühnemann, A.; Vogler, H.: Linear deterministic multi bottom-up tree transducers. In: Theoretical Computer Science 347 (2005), S. 276–287


Diese Informationen werden vom FIS bereitgestellt.
Stand: 20.11.2019 22:26 Uhr