Results 71 to 80 of about 3,411 (291)
Computation of distances for regular and context-free probabilistic languages [PDF]
, 2008 Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syntactic pattern matching and machine learning.
Satta, Giorgio +5 more
core +1 more source
Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization
Advanced Engineering Materials, EarlyView.Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier +17 more
wiley +1 more source
Completeness Theorems for Kleene algebra with tests and top [PDF]
Logical Methods in Computer ScienceWe prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of Kleene algebra ...
Damien Pous, Jana Wagemaker
doaj +1 more source
Regular Languages: To Finite Automata and Beyond Succinct : Descriptions and Optimal Simulations [PDF]
, 2021 It is well known that the class of regular languages coincides with the class of languages recognized by finite automata. Nevertheless, many other characterizations of this class in terms of computational devices and generative models are present in the ...
Luca Prigioniero, Prigioniero, Luca
core +1 more source
Advanced Engineering Materials, EarlyView.Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch +3 more
wiley +1 more source
All about unambiguous polynomial closure [PDF]
TheoretiCSWe 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
The PRIMA Thesaurus for Materials Science and Engineering
Advanced Engineering Materials, EarlyView.The PRIMA Thesaurus is a structured vocabulary designed to improve how materials science data is described and shared. Developed with input from multiple experts, it enables clear documentation of research workflows, data exchange, and reuse across platforms.
Rossella Aversa +8 more
wiley +1 more source
Simulations for Event-Clock Automata [PDF]
Logical Methods in Computer ScienceEvent-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and are practically useful to capture timed specifications.
S Akshay +3 more
doaj +1 more source
Quantitative Automata under Probabilistic Semantics [PDF]
Logical Methods in Computer Science, 2019 Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions,
Krishnendu Chatterjee +2 more
doaj +1 more source
A Direct Translation from XPath to Nondeterministic Automata [PDF]
, 2011 Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into automata, and produce efficient translations of XPath queries into automata on ...
Leonid Libkin +5 more
core