Results 1 to 10 of about 663,881 (275)

A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra [PDF]

open access: yesLogical Methods in Computer Science, 2019
$\omega$-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as $\omega$-semigroups are convenient algebras for infinite words.
Mikołaj Bojańczyk, Bartek Klin
doaj   +2 more sources

An InGaAs/InP DHBT With Simultaneous $\text{f}_{\boldsymbol \tau }/\text{f}_{\text {max}}~404/901$ GHz and 4.3 V Breakdown Voltage

open access: goldIEEE Journal of the Electron Devices Society, 2015
We report an InP/InGaAs/InP double heterojunction bipolar transistor fabricated in a triple-mesa structure, exhibiting simultaneous 404 GHz fτ and 901 GHz fmax.
Johann C. Rode   +12 more
doaj   +2 more sources

The Church Synthesis Problem with Parameters [PDF]

open access: yesLogical Methods in Computer Science, 2007
For a two-variable formula ψ(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of an operator Y=F(X) such that ψ(X,F(X)) is universally valid over Nat.
Alexander Rabinovich
doaj   +1 more source

Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]

open access: yesLogical Methods in Computer Science, 2007
String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure.
Joost Engelfriet, Hendrik Jan Hoogeboom
doaj   +1 more source

On Second-Order Monadic Monoidal and Groupoidal Quantifiers [PDF]

open access: yesLogical Methods in Computer Science, 2010
We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages.
Juha Kontinen, Heribert Vollmer
doaj   +1 more source

Feasibility of radical cardiac‐sparing, treatment planning strategies for patients with locally advanced, non‐small cell lung cancer

open access: yesJournal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022
Abstract Purpose A set of treatment planning strategies were designed and retrospectively implemented for locally advanced, non‐small cell lung cancer (NSCLC) patients in order to minimize cardiac dose without compromising target coverage goals. Methods Retrospective analysis was performed for 20 NSCLC patients prescribed to 60–66 Gy that received a ...
Joshua P. Kim   +5 more
wiley   +1 more source

Weighted Logics for Nested Words and Algebraic Formal Power Series [PDF]

open access: yesLogical Methods in Computer Science, 2010
Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper we introduce quantitative extensions and study nested word series which assign to nested words elements of a semiring. We show
Christian Mathissen
doaj   +1 more source

Joint application of hybrid iterative reconstruction and adaptive filters on neck‐and‐shoulder CT imaging: A clinical evaluation

open access: yesJournal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022
Abstract Purpose To assess whether the joint application of hybrid iterative reconstruction (HIR) and an adaptive filter (AF) could reduce streak artifacts and improve image quality of neck‐and‐shoulder computed tomography (CT). Methods This study included 96 patients with suspicious neck lesions who underwent a routine nonenhanced scan on a 64‐slice ...
Wenfeng Jin   +6 more
wiley   +1 more source

The Wadge Hierarchy of Deterministic Tree Languages [PDF]

open access: yesLogical Methods in Computer Science, 2008
We provide a complete description of the Wadge hierarchy for deterministically recognisable sets of infinite trees. In particular we give an elementary procedure to decide if one deterministic tree language is continuously reducible to another.
Filip Murlak
doaj   +1 more source

Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique [PDF]

open access: yesLogical Methods in Computer Science, 2008
In this paper, we first introduce a lower bound technique for the state complexity of transformations of automata. Namely we suggest first considering the class of full automata in lower bound analysis, and later reducing the size of the large alphabet ...
Qiqi Yan
doaj   +1 more source

Home - About - Disclaimer - Privacy