Results 51 to 60 of about 283,476 (338)

Weighted omega-Restricted One Counter Automata [PDF]

open access: yesLogical Methods in Computer Science, 2018
Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic system over a ...
Manfred Droste, Werner Kuich
doaj   +1 more source

Evaluating two methods for Treebank grammar compaction [PDF]

open access: yes, 1999
Treebanks, such as the Penn Treebank, provide a basis for the automatic creation of broad coverage grammars. In the simplest case, rules can simply be ‘read off’ the parse-annotations of the corpus, producing either a simple or probabilistic context-free
Gaizauskas, R.   +3 more
core   +1 more source

A qualitative descriptive study of effective leadership and leadership development strategies used by nurse leaders in European island countries

open access: yesNursing Open, Volume 10, Issue 2, Page 1071-1082, February 2023., 2023
Abstract Aim Nurse leaders influence workplace culture; however, little is known about ethnic cultural influences on nurse leader development. This research aims to identify personal strategies promoting effective leadership by nurse leaders from European small island countries. Design Descriptive qualitative study.
Victoria Hughes   +4 more
wiley   +1 more source

Multiplicative-Additive Focusing for Parsing as Deduction [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2015
Spurious ambiguity is the phenomenon whereby distinct derivations in grammar may assign the same structural reading, resulting in redundancy in the parse search space and inefficiency in parsing.
Glyn Morrill, Oriol Valentín
doaj   +1 more source

Syntactic Pattern Recognition for the Prediction of L-Type Pseudoknots in RNA

open access: yesApplied Sciences, 2023
The observation and analysis of RNA molecules have proved crucial for the understanding of various processes in nature. Scientists have mined knowledge and drawn conclusions using experimental methods for decades.
Christos Koroulis   +4 more
doaj   +1 more source

Technology supports in the UDL framework: Removable scaffolds or permanent new literacies?

open access: yesReading Research Quarterly, Volume 58, Issue 1, Page 44-58, January/February/March 2023., 2023
ABSTRACT Sharing multiliteracies goals of equitable access to educational success, the Universal Design for Learning (UDL) framework includes the use of contemporary technology tools, or new literacies, to customize ways to access information and processes and to construct and communicate knowledge. UDL also positions technology as a scaffold.
Sheri Vasinda, Jodi Pilgrim
wiley   +1 more source

On Decidability and Expressive Power of Fusion Grammars [PDF]

open access: yesarXiv, 2023
We prove decidability of the non-emptiness problems for fusion grammars and decidability of the membership problem for fusion grammars without markers and connectors. Additionally, we prove the Parikh theorem for connection-preserving fusion grammars.
arxiv  

Knotify: An Efficient Parallel Platform for RNA Pseudoknot Prediction Using Syntactic Pattern Recognition

open access: yesMethods and Protocols, 2022
Obtaining valuable clues for noncoding RNA (ribonucleic acid) subsequences remains a significant challenge, acknowledging that most of the human genome transcribes into noncoding RNA parts related to unknown biological operations.
Christos Andrikos   +5 more
doaj   +1 more source

VLGrammar: Grounded Grammar Induction of Vision and Language [PDF]

open access: yesarXiv, 2021
Cognitive grammar suggests that the acquisition of language grammar is grounded within visual structures. While grammar is an essential representation of natural language, it also exists ubiquitously in vision to represent the hierarchical part-whole structure. In this work, we study grounded grammar induction of vision and language in a joint learning
arxiv  

On multiple context-free grammars

open access: yesTheoretical Computer Science, 1991
AbstractMultiple context-free grammars (mcfg's) is a subclass of generalized context-free grammars introduced by Pollard (1984) in order to describe the syntax of natural languages. The class of languages generated by mcfg's (called multiple context-free languages or, shortly, mcfl's) properly includes the class of context-free languages and is ...
Mamoru Fujii   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy