Results 51 to 60 of about 171,423 (283)
Per Linguam : A Journal of Language Learning, 2013 Since April 1994, when eleven languages (instead of two) were given official recognition, language planning debates have focilsed on implementabilty rather than policy options.
Sinfree Makoni
doaj +1 more source
The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems [PDF]
, 2014 International audienceBounded languages have recently proved to be an important class of languages for the analysis of Turing-powerful models. For instance, bounded context-free languages are used to under-approximate the behav-iors of recursive programs.
A. Annichini +16 more
core +4 more sources
Information and Control, 1978 The POL be the class of polynomials having nonnegative integer coefficients and EXP the class of exponential functions. We call the closure of POL ∪ EXP under superposition, primitive recursion, and exponentiation, the class of elementary functions (EF). We have obtained that every elementary bounded language (i.e., language in the form {w1f1(n) ⋯ wtft(
openaire +2 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction Pre‐dilution online hemodiafiltration (Pre‐HDF) is predominantly used in Japan, whereas post‐dilution online HDF (Post‐HDF) is more common in Europe. An asymmetric cellulose triacetate (ATA) membrane may improve biocompatibility.
Kenji Sakurai +4 more
wiley +1 more source
Exploring the Boundaries of Monad Tensorability on Set [PDF]
Logical Methods in Computer Science, 2013 We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the component ...
Nathan Bowler +3 more
doaj +1 more source
Vilnius University Open Series, 2021 The article examines non-deictic uses of present and future tense in Lithuanian. Narrative use, in which reference intervals match with singular events, is distinguished from suspended propositions characterized by lack of such reference intervals ...
Björn Wiemer
doaj +1 more source
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source
Bounding linear head reduction and visible interaction through skeletons [PDF]
Logical Methods in Computer Science, 2015 In this paper, we study the complexity of execution in higher-order programming languages. Our study has two facets: on the one hand we give an upper bound to the length of interactions between bounded P-visible strategies in Hyland-Ong game semantics ...
Pierre Clairambault
doaj +1 more source
Proof Complexity Meets Algebra [PDF]
, 2017 We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional and semi-algebraic proof systems, the classical constructions of pp-interpretability ...
Atserias, Albert, Ochremiak, Joanna
core +6 more sources
FEBS Letters, EarlyView.The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li +2 more
wiley +1 more source