Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Frank, Drewes"'
Publikováno v:
Computational Linguistics, Vol 48, Iss 1, Pp 119-153 (2022)
AbstractWe show that a previously proposed algorithm for the N-best trees problem can be made more efficient by changing how it arranges and explores the search space. Given an integer N and a weighted tree automaton (wta) M over the tropical semirin
Externí odkaz:
https://doaj.org/article/04be039535e94327bfda4290c825083e
Autor:
Frank, Drewes, Jérôme, Leroux
Publikováno v:
Logical Methods in Computer Science, Volume 11, Issue 4 (December 22, 2015) lmcs:1616
A Petri net is structurally cyclic if every configuration is reachable from itself in one or more steps. We show that structural cyclicity is decidable in deterministic polynomial time. For this, we adapt the Kosaraju's approach for the general reach
Externí odkaz:
http://arxiv.org/abs/1510.08331
Publikováno v:
Computational Linguistics, Vol 44, Iss 1, Pp 119-186 (2018)
Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning. A deficit in this area of research is a formal framework for creating, combining, and using models involving graphs that parallels th
Externí odkaz:
https://doaj.org/article/010e8c1fc19b4a4a9d282979566ba5c8
Autor:
Frank Drewes, Makoto Kanazawa
Publikováno v:
Journal of Language Modelling, Vol 7, Iss 2, Pp 1–2-1–2 (2019)
For more than half a century, finite-state methods and mathematical linguistics have benefitted from a close relation and fruitful interaction. Both research fields aim to achieve a deeper understanding of human language by means of mathematical tech
Externí odkaz:
https://doaj.org/article/57bde2baa2e64694ab7af04bedda5080
Publikováno v:
Computational Linguistics, Vol 44, Iss 1 (2017)
Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning. A deficit in this area of research is a formal framework for creating, combining, and using models involving graphs that parallels th
Externí odkaz:
https://doaj.org/article/b089f8da0a3447d692fb2fe87b7448ff
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 151, Iss Proc. AFL 2014, Pp 109-123 (2014)
We develop a formal perspective on how regular expression matching works in Java, a popular representative of the category of regex-directed matching engines. In particular, we define an automata model which captures all the aspects needed to study s
Externí odkaz:
https://doaj.org/article/ec14689490654d7baecf7fdb554af28b
Autor:
Frank Drewes, Gerold Jäger
Publikováno v:
Theoretical Computer Science. 806:344-362
In this work we determine the metric dimension of Zn × Zn × Zn as ⌊3n/2⌋ for all n ≥ 2. We prove this result by investigating a variant of Mastermind.Mastermind is a famous two-player game that has ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::389b56d61633564ed2eefe255510aa4d
https://doi.org/10.1016/j.tcs.2019.05.042
https://doi.org/10.1016/j.tcs.2019.05.042
Publikováno v:
Graph Transformation ISBN: 9783031098420
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::642bdc6805acd0a887cb37975c573df7
https://doi.org/10.1007/978-3-031-09843-7_1
https://doi.org/10.1007/978-3-031-09843-7_1
Publikováno v:
Implementation and Application of Automata ISBN: 9783031074684
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ecdbb068e8300404e757f59db1a82db6
https://doi.org/10.1007/978-3-031-07469-1_7
https://doi.org/10.1007/978-3-031-07469-1_7
Autor:
Andrea Corradini, Frank Drewes
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 48, Iss Proc. TERMGRAPH 2011, Pp 3-18 (2011)
The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one
Externí odkaz:
https://doaj.org/article/0bab18039d714a8c8751f824fc3d3fb4