Segui
Florian Starke
Florian Starke
PhD Student, TU Dresden
Email verificata su tu-dresden.de
Titolo
Citata da
Citata da
Anno
Uniform parsing for hyperedge replacement grammars
H Björklund, F Drewes, P Ericson, F Starke
Journal of Computer and System Sciences 118, 1-27, 2021
132021
ASNP: A tame fragment of existential second-order logic
M Bodirsky, S Knäuer, F Starke
Beyond the Horizon of Computability: 16th Conference on Computability in …, 2020
122020
Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
M Bodirsky, F Starke, A Vucaj
International Journal of Algebra and Computation 31 (05), 929-967, 2021
112021
Maximal digraphs with respect to primitive positive constructability
M Bodirsky, F Starke
Combinatorica 42 (Suppl 1), 997-1010, 2022
92022
The smallest hard trees
M Bodirsky, J Bulín, F Starke, M Wernthaler
Constraints 28 (2), 105-137, 2023
42023
On associative operations on commutative integral domains
E Lehtonen, F Starke
Semigroup Forum 100, 910-915, 2020
42020
Digraphs modulo primitive positive constructability
F Starke
arXiv preprint arXiv:2402.16729, 2024
12024
Finite Simple Groups in the Primitive Positive Constructability Poset
S Meyer, F Starke
arXiv preprint arXiv:2409.06487, 2024
2024
Symmetric Linear Arc Monadic Datalog and Gadget Reductions
M Bodirsky, F Starke
arXiv preprint arXiv:2407.04924, 2024
2024
Exploring the topological entropy of formal languages
F Starke
Theoretical Computer Science 849, 210-226, 2021
2021
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–10