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

1 bis 16 von 16 Einträgen

Drewes, Frank; Vogler, Heiko: Learning deterministically recognizable tree series. In: Journal of Automata, Languages and Combinatorics 12 (2007), Nr. 3, S. 332–354

Droste, Manfred (Hrsg.); Vogler, Heiko (Hrsg.): Selected Papers of the Workshop Weighted Automata: Theory and Applications (WATA 2006). Languages and Combinatorics 12, Nr. 4 (2007)

Maletti, A.: Compositions of extended top-down tree transducers. In: Proc. 1st Int. Conf. Language and Automata Theory and Applications. Report 35/07 (2007), S. 379–390

Maletti, A.: Pure and O-Substitution. In: Int. J. Found. Comput. Sci. 18(4) (2007), S. 829–845

Maletti, A.: Myhill-Nerode theorem for recognizable tree series revisited. In: Proc. 1st Int. Conf. AutoMathA: From Mathematics to Applications (2007)

Maletti, A.: Learning deterministically recognizable tree series revisited. In: Proc. 2nd Int. Conf. Algebraic Informatics LNCS 4728 (2007), S. 218–235

Högberg, J.; Maletti, Andreas; May, J.: Bisimulation minimisation for weighted tree automata. In: Proc. 11th Int. Conf. Developments in Language Theory LNCS 4588 (2007), S. 229–241

Högberg, J.; Maletti, Andreas; May, J.: Backward and forward bisimulation minimisation of tree automata. In: Proc. 12th Int. Conf. Implementation and Application of Automata LNCS 4783 (2007), S. 109–121

Giesl, J.; Kühnemann, Armin; Voigtländer, Janis: Deaccumulation Techniques for Improving Provability. In: Journal of Logic and Algebraic Programming (2007)

Voigtländer, Janis; Johann, P.: Selective strictness and parametricity in structural operational semantics, inequationally. In: Theoretical Computer Science 388 (2007), Nr. 1–3, S. 290–318

Voigtländer, J.: Formal Efficiency Analysis for Tree Transducer Composition. In: Theory of Computing Systems 41 (2007), Nr. 4, S. 619–689

Högberg, J.; Maletti, A.; May, J.: Backward and Forward Bisimulation Minimisation of Tree Automata. In: Technical Report ISI-TR-633 (2007)

Högberg, J.; Maletti, A.; May, J.: Bisimulation Minimisation of Weighted Tree Automata. In: Technical Report ISI-TR-634 (2007)

Vogler, H.; Fülöp, Z.; Maletti, A.: A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. In: Theory Comput. Syst. (2007)

Maletti, A.: Pure and O-Substitution. In: Int. J. Found. Comput. Sci. 18(4) (2007), S. 829–845

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


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