Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Maximilian Schlund"'
Autor:
Laurent Mauborgne, Christian Ferdinand, Stephan Wilhelm, Maximilian Schlund, Bernard Schmidt, Daniel Kaestner
Publikováno v:
SAE Technical Paper Series.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2ad96fb90213b6a23a1d0c833d0b608
https://doi.org/10.4271/2019-01-1246
https://doi.org/10.4271/2019-01-1246
Publikováno v:
Information and Computation. 246:43-61
We give a lower bound on the speed at which Newton's method (as defined in 11) converges over arbitrary ω-continuous commutative semirings. From this result, we deduce that Newton's method converges within a finite number of iterations over any semi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d299240ef2b1e537093b2f10ff325c6
https://doi.org/10.1016/j.ic.2015.11.008
https://doi.org/10.1016/j.ic.2015.11.008
Publikováno v:
International Journal of Foundations of Computer Science. 26:805-825
We introduce FPSOLVE, an implementation of generic algorithms for solving fixpoint equations over semirings. We first illustrate the interest of generic solvers by means of a scenario. We then succinctly describe some of the algorithms implemented in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6949a493cbfab48fb977c5fae74fb29
https://doi.org/10.1142/s0129054115400018
https://doi.org/10.1142/s0129054115400018
Publikováno v:
Fundamenta Informaticae. 113:205-228
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00fe0fe7b81bf9266ee1293b1199f8e7
https://doi.org/10.3233/fi-2011-607
https://doi.org/10.3233/fi-2011-607
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783319155784
LATA
LATA
We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the state-complexity of representing sub- or superword closures of context-free grammars (CFGs): (1) We prove a (tight) upper bound of \(2^{\mathcal {O}(n)}\) on the size of nondetermi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7f723c02efd1eea1c1c7ae21a5116c1
https://doi.org/10.1007/978-3-319-15579-1_37
https://doi.org/10.1007/978-3-319-15579-1_37
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783319049205
LATA
LATA
The Strahler number or Horton-Strahler number of a tree, originally introduced in geophysics, has a surprisingly rich theory. We sketch some milestones in its history, and its connection to arithmetic expressions, graph traversing, decision problems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c08ba18d61dae5ad752bd5c026c7f02
https://doi.org/10.1007/978-3-319-04921-2_1
https://doi.org/10.1007/978-3-319-04921-2_1
Publikováno v:
EACL
We suggest a new annotation scheme for unlexicalized PCFGs that is inspired by formal language theory and only depends on the structure of the parse trees. We evaluate this scheme on the T¨ uBa-D/Z treebank w.r.t. several metrics and show that it im
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::614f9596228caf5b5f773c2efb68b869
https://doi.org/10.3115/v1/e14-4032
https://doi.org/10.3115/v1/e14-4032
Publikováno v:
Implementation and Application of Automata ISBN: 9783319088457
CIAA
CIAA
We introduce FPsolve, an implementation of generic algorithms for solving fixpoint equations over semirings. We first illustrate the interest of generic solvers by means of a scenario. We then succinctly describe some of the algorithms implemented in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ab4668dadbc03def6873eecb21e0d85
https://doi.org/10.1007/978-3-319-08846-4_1
https://doi.org/10.1007/978-3-319-08846-4_1
Publikováno v:
Logic for Programming, Artificial Intelligence, and Reasoning ISBN: 9783642452208
LPAR
LPAR
We present the first implementation of Newton’s method for solving systems of equations over ω-continuous semirings (based on [5,11]). For instance, such equation systems arise naturally in the analysis of interprocedural programs or the provenanc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84d62e4de79440a32579c23646261072
https://doi.org/10.1007/978-3-642-45221-5_48
https://doi.org/10.1007/978-3-642-45221-5_48
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783642370632
LATA
LATA
We give a lower bound on the speed at which Newton’s method (as defined in [5,6]) converges over arbitrary ω-continuous commutative semirings. From this result, we deduce that Newton’s method converges within a finite number of iterations over a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b12ebfcafdf0fa96aa29218763a53a82
https://doi.org/10.1007/978-3-642-37064-9_36
https://doi.org/10.1007/978-3-642-37064-9_36