Zobrazeno 1 - 10
of 37
pro vyhledávání: '"H.J. Sander"'
Publikováno v:
In Science of Computer Programming 15 June 2015 104:71-98
Publikováno v:
In Journal of Visual Languages and Computing June 2013 24(3):192-206
Autor:
Bruggink, H.J. Sander
Publikováno v:
In Electronic Notes in Theoretical Computer Science 5 May 2008 213(1):23-38
We consider recognizable languages of cospans in adhesive categories, of which recognizable graph languages are a special case. We show that such languages are closed under concatenation, i.e. under cospan composition, by providing a con-crete constr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2843aad3b0cbd411c646e83d03e01fa4
In this paper we introduce alternating automata for languages of arrows of an arbitrary category, and as an instantiation thereof alternating automata for graph languages. We study some of their closure properties and compare them, with respect to ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=unidue___bib::d6662d5611d2de4b5e5ca4003be2bf5a
https://journal.ub.tu-berlin.de/eceasst/article/view/734
https://journal.ub.tu-berlin.de/eceasst/article/view/734
Autor:
John A. Foekens, Steven W. J. Lamberts, H.J. Sander, B. Setyono-Han, J. G. M. Klijn, G.H. Deckers, F. H. De Jong
Publikováno v:
Human Reproduction. 9:181-189
Antiprogestins form a new potential treatment modality for breast cancer and their mode of action has been assessed in vitro on several breast cancer cell lines, in vivo in rats with dimethylbenzanthracene (DMBA)-induced mammary tumours and in vivo i
Recognizable graph languages are a generalization of regular (word) languages to graphs (as well as arbitrary categories). Recently automaton functors were proposed as acceptors of recognizable graph languages. They promise to be a useful tool for th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1cd54ea994f51d688f86bab4aae0d13b
We generalize the order-theoretic variant of the Myhill-Nerode theorem to graph languages, and characterize the recognizable graph languages as the class of languages for which the Myhill-Nerode quasi order is a well quasi order. In the second part o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=unidue___bib::c37df80ba5bb2e0005309fc0141e3b51
https://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&origin=inward&scp=84867627779
https://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&origin=inward&scp=84867627779
Publikováno v:
Endocrine Therapy of Breast Cancer VI ISBN: 9783642788161
Endocrine Therapy of Breast Cancer VI
Endocrine Therapy of Breast Cancer VI
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e9222c7d5027aee3c2d3521e1263552
https://doi.org/10.1007/978-3-642-78814-7_8
https://doi.org/10.1007/978-3-642-78814-7_8
Publikováno v:
European Journal of Cancer. 32:47-48