Results 81 to 90 of about 2,934 (199)

Deterministic pushdown automata can compress some normal sequences [PDF]

open access: yesLogical Methods in Computer Science
In this paper, we give a deterministic pushdown transducer and a normal sequence of digits compressed by it. This solves positively a question left open in a previous paper by V. Becher, P. A. Heiber and the first author.
Olivier Carton, Sylvain Perifel
doaj   +1 more source

Automating Chemical Reasoning in High‐Throughput Phase Identification With a Probabilistic, LLM‐Guided Framework

open access: yesAdvanced Science, EarlyView.
Autonomous laboratories can now synthesize materials faster than experts can interpret the resulting diffraction data. A probabilistic framework combines refinement‐fit metrics with large language model‐derived chemical reasoning to rank competing phase interpretations and flag those unsuitable for autonomous use.
Olympia Dartsi   +7 more
wiley   +1 more source

Finite-valued Streaming String Transducers [PDF]

open access: yesTheoretiCS
A transducer is finite-valued if for some bound k, it maps any given input to at most k outputs. For classical, one-way transducers, it is known since the 80s that finite valuedness entails decidability of the equivalence problem.
Emmanuel Filiot   +5 more
doaj   +1 more source

Strategy of Triple‐Gradient in Binary Pixels for Flexible Pressure Sensing with High Sensitivity and Wide‐Range Linearity

open access: yesAdvanced Science, EarlyView.
A flexible pressure sensor with triple‐gradient design of conductivity, modulus, and dimension in binary micro‐dome pixels is proposed. Based on precisely‐designed CNT/PDMS matrix, the device exhibits a linear sensitivity of 974.1 kPa−1 across range up to 1.8 MPa (R2 > 0.99), offering an effective strategy for potential applications in healthcare ...
Yifan Liu   +9 more
wiley   +1 more source

Constructing Deterministic Parity Automata from Positive and Negative Examples [PDF]

open access: yesTheoretiCS
We present a polynomial time algorithm that constructs a deterministic parity automaton (DPA) from a given set of positive and negative ultimately periodic example words. We show that this algorithm is complete for the class of $\omega$-regular languages,
León Bohn, Christof Löding
doaj   +1 more source

Robust Controller Synthesis in Timed Automata [PDF]

open access: yes, 2013
We consider the fundamental problem of Büchi acceptance in timed automata in a robust setting. The problem is formalised in terms of controller synthesis: timed automata are equipped with a parametrised game-based semantics that models the possible ...
Reynier, Pierre-Alain   +7 more
core   +1 more source

CoSP: Reconfigurable Metamaterial Inverse Design via Contrastive Pretrained Large Language Model

open access: yesAdvanced Science, EarlyView.
In this work, CoSP (contrastive multi‐state pretrain), an intelligent inverse design method for reconfigurable metamaterials based on a contrastive pretrained large language model, is proposed. Numerical experiments demonstrate that CoSP can design reconfigurable metamaterial structures for multi‐state, multi‐band optical responses, showing great ...
Shujie Yang   +4 more
wiley   +1 more source

Formal Analysis of the Contract Automata Runtime Environment with Uppaal: Modelling, Verification and Testing [PDF]

open access: yesLogical Methods in Computer Science
Recently, a distributed middleware application called contract automata runtime environment (CARE) has been introduced to realise service applications specified using a dialect of finite-state automata.
Davide Basile
doaj   +1 more source

Toward Personalized Theranostics: A Modular PET Platform for Antibody‐Based Imaging and Therapy

open access: yesAdvanced Science, EarlyView.
This modular, site‐specific antibody platform enables customizable conjugates for PET imaging and therapy. Interchangeable payloads – including radiometals, cytotoxics, and fluorophores – support adaptable, multimodal applications with limited off‐target effects. In vivo, the DFO/DOTAGA bischelate immunoconjugate provided clear tumor delineation in PET/
Delphine Vivier   +16 more
wiley   +1 more source

All about unambiguous polynomial closure [PDF]

open access: yesTheoretiCS
We study a standard operator on classes of languages: unambiguous polynomial closure. We prove that for every class C of regular languages satisfying mild properties, the membership problem for its unambiguous polynomial closure UPol(C) reduces to the ...
Thomas Place, Marc Zeitoun
doaj   +1 more source

Home - About - Disclaimer - Privacy