Results 31 to 40 of about 52,651 (265)
Partial Word Order Syntax of Urdu/Sindhi and Linear Specification Language
JISR Management and Social Sciences & Economics, 2007 Like most of the South-Asian languages Urdu and Sindhi are partial word order languages. Conventional syntax representation models like Context Free Grammars are not capable enough to cope with partial word order syntax.
Mutee-u- Rahman +2 more
doaj +1 more source
On Languages Accepted by P/T Systems Composed of joins [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Recently, some studies linked the computational power of abstract computing systems based on multiset rewriting to models of Petri nets and the computation power of these nets to their topology.
Pierluigi Frisco, Oscar H. Ibarra
doaj +1 more source
Parallel context-free languages
Information and Control, 1974 <p>The relation between the family of context-free languages and the family of parallel context-free languages is examined in this paper. It is proved that the families are incomparable. Finally we prove that the family of languages of finite index is contained in the family of parallel context-free languages.</p><p>Information and ...
Rani Siromoney, Kamala Krithivasan
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Embryonal tumors comprise the majority of malignant central nervous system (CNS) neoplasms diagnosed in children under 3 years of age. Compared with their counterparts in older children, these tumors exhibit distinct molecular biology and a more aggressive clinical phenotype, while their management is complicated by the heightened ...
Sudarshawn Damodharan +3 more
wiley +1 more source
Generative Power and Closure Properties of Watson-Crick Grammars
Applied Computational Intelligence and Soft Computing, 2016 We define WK linear grammars, as an extension of WK regular grammars with linear grammar rules, and WK context-free grammars, thus investigating their computational power and closure properties.
Nurul Liyana Mohamad Zulkufli +3 more
doaj +1 more source
On Free $\omega$-Continuous and Regular Ordered Algebras [PDF]
Logical Methods in Computer Science, 2019 We study varieties of certain ordered $\Sigma$-algebras with restricted completeness and continuity properties. We give a general characterization of their free algebras in terms of submonads of the monad of $\Sigma$-coterms.
Zoltan Esik, Dexter Kozen
doaj +1 more source
Phosphatidylinositol 4‐kinase as a target of pathogens—friend or foe?
FEBS Letters, EarlyView.This graphical summary illustrates the roles of phosphatidylinositol 4‐kinases (PI4Ks). PI4Ks regulate key cellular processes and can be hijacked by pathogens, such as viruses, bacteria and parasites, to support their intracellular replication. Their dual role as essential host enzymes and pathogen cofactors makes them promising drug targets.
Ana C. Mendes +3 more
wiley +1 more source
FEBS Letters, EarlyView.Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
FEBS Letters, EarlyView.Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
On regularity of context-free languages
Computer Compacts, 1983 This paper considers conditions under which a context-free language is regular and conditions which imposed on (productions of) a rewriting system generating a context-free language will guarantee that the generated language is regular. In particular: (1) necessary and sufficient conditions on productions of a unitary grammar are given that guarantee ...
Andrzej Ehrenfeucht +2 more
openaire +2 more sources