Results 61 to 70 of about 1,576 (262)
Expressiveness of Visibly Pushdown Transducers [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced to model transformations of nested words, i.e. words with a call/return structure.
Mathieu Caralp +4 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.We develop a data‐driven method to derive the mathematical expressions of the Flory–Huggins interaction parameter χ for the swelling behavior of temperature–responsive hydrogels. Starting from initial assumptions of χ, our workflow combines Bayesian optimization, Flory–Rehner theory, and symbolic regression to generate candidate χ expressions.
Yawen Wang +2 more
wiley +1 more source
Tree games with regular objectives [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study tree games developed recently by Matteo Mio as a game interpretation of the probabilistic μ-calculus. With expressive power comes complexity.
Marcin Przybyłko
doaj +1 more source
Dependency Tree Automata [PDF]
, 2009 We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are defined, nondeterministic and alternating. We show that the nondeterministic automata have a decidable nonemptiness problem and leave as an open question whether this is true ...
openaire +2 more sources
Microstructure Evolution of a VMnFeCoNi High‐Entropy Alloy After Synthesis, Swaging, and Annealing
Advanced Engineering Materials, EarlyView.The synthesis and processing (rotary swaging and annealing) of the novel VMnFeCoNi alloy is investigated, alongside the estimation of the grain size effect on hardness. Analysis of a wide grain size range of recrystallized microstructures (12–210 µm) reveals a low annealing twin density.
Aditya Srinivasan Tirunilai +6 more
wiley +1 more source
FINITE TREE AUTOMATA ON INFINITE TREES [PDF]
Bulletin of informatics and cybernetics, 1985 For finite automata on infinite words or trees there are several natural ways to define acceptance. Compared to the cases of finite words or trees the situation is further complicated by the fact that nondeterminism properly increases the recognition power of automata. The authors have set out to clarify the relationships between six modes of accepting
Hayashi, Takeshi, Miyano, Satoru
openaire +2 more sources
PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science
Advanced Engineering Materials, EarlyView.Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley +1 more source
Theoretical Computer Science, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Advanced Engineering Materials, EarlyView.Low‐voltage FIB‐SEM tomography combined with a image preprocessing pipeline improves phase contrast and enables reliable machine‐learning segmentation of conductive networks in lithium‐ion battery electrodes. Structural descriptors are extracted from segmented images, done semimanually and automated, and compared.
Lisa Beran +6 more
wiley +1 more source
Synthesizing Structured Reactive Programs via Deterministic Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Existing approaches to the synthesis of reactive systems typically involve the construction of transition systems such as Mealy automata. However, in order to obtain a succinct representation of the desired system, structured programs can be a more ...
Benedikt Brütsch
doaj +1 more source