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 Bjrklund, F Drewes, P Ericson, F Starke
Journal of Computer and System Sciences 118, 1-27, 2021
122021
ASNP: A tame fragment of existential second-order logic
M Bodirsky, S Knuer, F Starke
Beyond the Horizon of Computability: 16th Conference on Computability in…, 2020
102020
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
62021
On associative operations on commutative integral domains
E Lehtonen, F Starke
Semigroup Forum 100, 910-915, 2020
52020
Maximal digraphs with respect to primitive positive constructability
M Bodirsky, F Starke
Combinatorica 42 (Suppl 1), 997-1010, 2022
42022
The smallest hard trees
M Bodirsky, J Buln, F Starke, M Wernthaler
Constraints, 1-33, 2023
22023
Smooth digraphs modulo primitive positive constructability
M Bodirsky, F Starke, A Vucaj
arXiv preprint arXiv:1906.05699, 2019
12019
Digraphs modulo primitive positive constructability
F Starke
arXiv preprint arXiv:2402.16729, 2024
2024
Maximal Digraphs With Respect to Primitive Positive Constructibility
F Starke, M Bodirsky
arXiv preprint arXiv:2103.08625, 2021
2021
Exploring the topological entropy of formal languages
F Starke
Theoretical Computer Science 849, 210-226, 2021
2021
Topological Entropy of Formal Languages.
F Starke
arXiv preprint arXiv:1801.07321, 2018
2018
Il sistema al momento non pu eseguire l'operazione. Riprova pi tardi.
Articoli 1–11