Results 41 to 50 of about 663,881 (275)
On the Expressiveness of the Ambient Logic [PDF]
Logical Methods in Computer Science, 2006 The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. In this paper, we study the expressiveness of AL.
Daniel Hirschkoff +2 more
doaj +1 more source
Widths of regular and context-free languages [PDF]
39th IARCS Annual Conference on Foundations of Software Technology
and Theoretical Computer Science (FSTTCS 2019), 2017 Given a partially-ordered finite alphabet $\Sigma$ and a language $L\subseteq \Sigma^*$, how large can an antichain in $L$ be (where $L$ is given the lexicographic ordering)? More precisely, since $L$ will in general be infinite, we should ask about the rate of growth of maximum antichains consisting of words of length $n$. This fundamental property of
arxiv +1 more source
Context-Sensitive Languages, Rational Graphs and Determinism [PDF]
Logical Methods in Computer Science, 2006 We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices.
Arnaud Carayol, Antoine Meyer
doaj +1 more source
Coalgebras for Bisimulation of Weighted Automata over Semirings [PDF]
Logical Methods in Computer Science, 2023 Weighted automata are a generalization of nondeterministic automata that associate a weight drawn from a semiring $K$ with every transition and every state.
Purandar Bhaduri
doaj +1 more source
First‐Line Atezolizumab plus Chemotherapy in Extensive‐Stage Small‐Cell Lung Cancer
New England Journal of Medicine, 2018 BACKGROUND Enhancing tumor‐specific T‐cell immunity by inhibiting programmed death ligand 1 (PD‐L1)–programmed death 1 (PD‐1) signaling has shown promise in the treatment of extensive‐stage small‐cell lung cancer.
L. Horn +20 more
semanticscholar +1 more source
The geometry of percolation fronts in two-dimensional lattices with spatially varying densities [PDF]
, 2012 Percolation theory is usually applied to lattices with a uniform probability p that a site is occupied or that a bond is closed. The more general case, where p is a function of the position x, has received less attention. Previous studies with long-range
Gastner, Michael T, Oborny, Beata
core +2 more sources
Expressiveness and Closure Properties for Quantitative Languages [PDF]
Logical Methods in Computer Science, 2010 Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages~$L$ that assign to each word~$w$ a real number~$L(w)$.
Krishnendu Chatterjee +2 more
doaj +1 more source
A phase-space approach to directional switching in semiconductor ring lasers [PDF]
, 2009 We show that a topological investigation of the phase space of a Semiconductor Ring Laser can be used to devise switching schemes which are alternative to optical pulse injection of counter-propagating light.
Beri, S. +3 more
core +2 more sources
Initial Semantics for Reduction Rules [PDF]
Logical Methods in Computer Science, 2019 We give an algebraic characterization of the syntax and operational semantics of a class of simply-typed languages, such as the language PCF: we characterize simply-typed syntax with variable binding and equipped with reduction rules via a universal ...
Benedikt Ahrens
doaj +1 more source
Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees [PDF]
Logical Methods in Computer Science, 2012 We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees.
Amélie Gheerbrant, Balder ten Cate
doaj +1 more source