Results 61 to 70 of about 859,079 (303)
Information and Control, 1974 In an earlier paper (Santos, 1973b), the author introduced two distinct but equivalent formulations of max-product grammars. One corresponds to the maximal interpretation (Salomaa, 1969) of probabilistic grammars (Santos, 1972), while the other provides a grammar for generating fuzzy languages (Santos, 1973a). Various types of max-product grammars were
openaire +3 more sources
Block-based syntax from context-free grammars
Software Language Engineering, 2020 Block-based programming systems employ a jigsaw metaphor to write programs. They are popular in the domain of programming education (e.g., Scratch), but also used as a programming interface for end-users in other disciplines, such as arts, robotics, and ...
M. V. Merino, T. Storm
semanticscholar +1 more source
Evaluating the Ability of LSTMs to Learn Context-Free Grammars [PDF]
BlackboxNLP@EMNLP, 2018 While long short-term memory (LSTM) neural net architectures are designed to capture sequence information, human language is generally composed of hierarchical structures. This raises the question as to whether LSTMs can learn hierarchical structures. We
Luzi Sennhauser, R. Berwick
semanticscholar +1 more source
Tumor B‐cell infiltration in platinum‐treated advanced muscle‐invasive urothelial carcinoma
Molecular Oncology, EarlyView.Bladder tumors with higher pretreatment memory B‐cell infiltration were linked to longer survival after cisplatin chemotherapy, but not carboplatin. These tumors also showed more organized immune structures (tertiary lymphoid structures) and a shared pro‐inflammatory B‐cell‐rich community, suggesting that memory B cells may help identify patients most ...
Konrad Stawiski +10 more
wiley +1 more source
Context-Free Transductions with Neural Stacks [PDF]
BlackboxNLP@EMNLP, 2018 This paper analyzes the behavior of stack-augmented recurrent neural network (RNN) models. Due to the architectural similarity between stack RNNs and pushdown transducers, we train stack RNN models on a number of tasks, including string reversal, context-
Sophie Hao +6 more
semanticscholar +1 more source
Loss of proton‐sensing TDAG8 increases tumor progression in mouse models of colon cancer
Molecular Oncology, EarlyView.Loss of the pH‐sensing receptor TDAG8 accelerates colorectal cancer progression in mice. Animals lacking TDAG8 expression had increased tumor growth, DNA damage, and recruitment of tumor‐associated immune cells, including macrophages, neutrophils, and monocytes.
Ermanno Malagola +11 more
wiley +1 more source
Erasable context-free languages
Information and Control, 1975 The family of (n, k)-bounded pushdown store automata is equivalent to its quasirealtime subfamily, for all n and k. In the course of the proof, a standard form theorem is established for nonterminal bounded context-free grammars and a specialized result is obtained for one-counter languages.
openaire +2 more sources
Molecular Oncology, EarlyView.Breast cancer remains a major cause of cancer death in women, frequently developing endocrine therapy resistance. This study demonstrates that upregulated p21‐activated kinase 1 (PAK1) activity drives resistance to tamoxifen and long‐term estrogen deprivation in ER+ breast cancer models.
Luisa Schwarzmüller +10 more
wiley +1 more source
Generalized Results on Monoids as Memory [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we demonstrate a context-free language that ...
Özlem Salehi +2 more
doaj +1 more source
A Simplified Lower Bound for Context-Free-Language Recognition
Information and Control, 1986 For on-line recognition of the words in an arbitrary linear context-free language, there are known tight bounds on the time required by a deterministic multitape Turing machine.
J. Seiferas
semanticscholar +1 more source