Seguir
Thomas Feller
Thomas Feller
Wissenschaftlicher Mitarbeiter, Technische Universität Dresden
Dirección de correo verificada de tu-dresden.de
Título
Citado por
Citado por
Año
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying
T Feller, TS Lyon, P Ostropolski-Nalewaja, S Rudolph
arXiv preprint arXiv:2209.02464, 2022
72022
Sequentiality of group-weighted tree automata
F Dörband, T Feller, K Stier
Language and Automata Theory and Applications: 15th International Conference …, 2021
42021
On logics and homomorphism closure
M Bodirsky, T Feller, S Knäuer, S Rudolph
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021
32021
Approximated determinisation of weighted tree automata
F Dörband, T Feller, K Stier
Language and Automata Theory and Applications: 15th International Conference …, 2021
32021
Decidability of Querying First-Order Theories via Countermodels of Finite Width
T Feller, TS Lyon, P Ostropolski-Nalewaja, S Rudolph
arXiv preprint arXiv:2304.06348, 2023
22023
The classification of homomorphism homogeneous tournaments
T Feller, C Pech, M Pech
European Journal of Combinatorics 89, 103142, 2020
22020
Klassifikation der endlichen polymorphismushomogenen Turniere mit Schleifen
T Feller
MasterГs thesis, TU Dresden, 2018
22018
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–7