Results 51 to 60 of about 25,771 (294)

Weighted parsing of trees

, 2009
We show how parsing of trees can be formalized in terms of the intersection of two tree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars.
Nederhof, Mark Jan, Mark-Jan Nederhof
core   +1 more source

Parsing Unranked Tree Languages, Folded Once

Algorithms
A regular unranked tree folding consists of a regular unranked tree language and a folding operation that merges (i.e., folds) selected nodes of a tree to form a graph; the combination is a formal device for representing graph languages.
Martin Berglund, Henrik Björklund, Johanna Björklund   +2 more
doaj   +1 more source

Longitudinal genome‐wide aneuploidy measurements in circulating cell‐free DNA to predict lack of benefit from pembrolizumab in patients with metastatic urothelial cancer

Molecular Oncology, EarlyView.
Many patients with urothelial cancer do not benefit from treatment with pembrolizumab, while at risk of severe side effects. Changes in the levels of circulating tumor DNA early during treatment, measured by a simple and affordable assay that can be easily implemented in the clinic, can be used as a prognostic tool to identify these patients.
Youssra Salhi, Stavros Makrodimitris, Sandra van Wilpe, Iris te Paske, Vanja de Weerd, Corine M. Beaufort, Hans M. Westgeest, Jens Voortman, Maureen J. B. Aarts, Maud Rijnders, Astrid A. M. van der Veldt, Ronald de Wit, Niven Mehra, Saskia M. Wilting, Debbie G. J. Robbrecht   +14 more
wiley   +1 more source

A Robust Class of Context-Sensitive Languages

, 2007
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolean operations.
MADHUSUDAN P, Torre, Salvatore La, Parlato, Gennaro, SALVATORE LA TORRE, P. MADHUSUDAN, Parthasarathy Madhusudan, Gennaro Parlato, Madhusudan, Parthasarathy, LA TORRE, Salvatore   +8 more
core   +1 more source

Scope-bounded pushdown languages [PDF]

, 2014
We study the formal language theory of multistack push-down automata (Mpa) restricted to computations where a symbol can be popped from a stack S only if it was pushed within a bounded number of contexts of S (scoped Mpa).
Salvatore La Torre, Parlato, Gennaro, Margherita Napoli, Napoli, Margherita, La Torre, Salvatore, Gennaro Parlato   +5 more
core   +1 more source

“Language Is the Place from Where the World Is Seen”—On the Gender of Trees, Fruit Trees and Edible Fruits in Portuguese and in Other Latin-Derived Languages

Languages, 2017
Trees have always been important as natural entities carrying a strong symbolic and metaphorical weight, not to mention their practical uses. Therefore, words and their gender, used to name natural entities as important as trees and particularly fruit ...
Luís Silva Dias, Alexandra Soveral Dias
doaj   +1 more source

Clinical Practice Guideline for Evaluation and Management of Peripheral Nervous System Manifestations in Sjögren's Disease

Arthritis Care &Research, EarlyView.
Objective Sjögren's disease is an autoimmune disorder that can impact multiple organ systems, including the peripheral nervous system (PNS). PNS manifestations, which can exist concurrently, include mononeuropathies, polyneuropathies, and autonomic nervous system neuropathies.
Anahita Deboo, Robert Fox, Katherine M. Hammitt, Julie Frantsve‐Hawley, Matthew C. Baker, Stamatina Danielides, Eduardo De Sousa, Brent P. Goodman, Jennifer K. King, Steven Mandel, Ghaith Noaiseh, Pantelis P. Pavlakis, George Sarka, R. Hal Scofield, Arun Varadhachary, Daniel J. Wallace, Matt Makara, Nancy Carteron, Steven Carsons, in collaboration with the Consensus Expert Panel (CEP) members, G. Alden Adkins, Brittany Adler, Hossein Ansari, Senada Arabelovic, Alan Baer, Denis Balaban, Shamik Bhattacharyya, Evelyn Bromet, Krishna Chaganti, Kamal Chemali, Melissa Cortez, Schartess Culpepper, Paul Dellaripa, Dana Direnzo, Daniel El Bogdadi, Robert Fearon, Mehrnez Fischbach, Judi Furlong, Christopher Gibbons, Rachael Gordon, Thomas Grader Beck, Syed Haider, Larry Hollenbeck, Chadwick R. Johr, Stuart S. Kassan, Brian King, Octavia Kincaid, Eugene Kissin, Vasileios Kyttaris, Lindsay Lally, Brandon M. Law, Janet Lewis, Scott M. Lieberman, Amanda Lusa, Joseph Lutt, Rashmi Maganti, Arthur M. Mandelin, Sara McCoy, Kerry Neall, Timothy Niewold, Anne Louise Oaklander, Ruben A. Peredo‐Wende, Lynn Petruzzi, Mark A. Porter, Guada Respicio Duque, Tania Reyna, Nathaniel M. Robbins, Elliot D. Rosenstein, Laura Rosow, Breanna Ruthrauff, Amit Sachdev, Nora Sandorfi, Sarah Schafer, Elena Schiopu, Chokkalingam Siva, Daniel Small, Sara M. Stern, Lauren Stiles, Susan Stoddard, Jinny Tavee, Donald Thomas, Edward L. Treadwell, Nagagopal Venna, Steven Vernino, Frederick B. Vivino, Brittany Weber, Sepideh Yadollahi, Huiying Yu, Scott Zashin   +88 more
wiley   +1 more source

Web and Semantic Web Query Languages [PDF]

, 2005
A number of techniques have been developed to facilitate powerful data retrieval on the Web and Semantic Web. Three categories of Web query languages can be distinguished, according to the format of the data they can retrieve: XML, RDF and Topic Maps.
Furche, Tim, Schaffert, Sebastian, Bailey, James, Bry, François, Sebastian Schaffert, François Bry, Tim Furche, James Bailey   +7 more
core   +1 more source

Visibly Tree Automata with Memory and Constraints [PDF]

Logical Methods in Computer Science, 2008
Tree automata with one memory have been introduced in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bogaert and Tison.
Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin   +2 more
doaj   +1 more source

A representation of trees by languages I

Theoretical Computer Science, 1978
AbstractWe apply certain technical results, published in the first part of the present work to obtain reductions between equivalence problems for simple deterministic tree grammars recursive program schemes and the (open) equivalence problem for DPDA's.
openaire   +2 more sources