Results 91 to 100 of about 3,411 (291)
Constructing Deterministic Parity Automata from Positive and Negative Examples [PDF]
TheoretiCSWe 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
Physics‐Grounded Materials Artificial Intelligence for Reliable Materials Discovery
Advanced Functional Materials, EarlyView.Physics‐Grounded Materials AI (PhysMat AI) integrates physical priors, descriptors, constraints, verification, and data infrastructure into a unified full‐stack framework, enabling reliable, interpretable, and autonomous AI‐driven materials discovery.
Yuhang Wang +3 more
wiley +1 more source
CS 466/666: Formal Languages and Automata [PDF]
, 2006 This course introduces the theory of formal languages and automata. The primary focus is on the two methods of defining languages: using generators (e.g., grammars/regular expressions) and using recognizers (e.g., finite state machines).
Thirunarayan, Krishnaprasad
core +2 more sources
Deterministic pushdown automata can compress some normal sequences [PDF]
Logical Methods in Computer ScienceIn 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
Advanced Functional Materials, EarlyView.Eu‐doped {ZnCdO/ZnO} structures grown on Si are developed, showcasing dual‐functionality controlled by europium doping. While high europium concentration transforms the device into an ultrafast, self‐powered photodetector, low‐doped structures can be used as an optoelectronic synapse.
Igor Perlikowski +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
, 2005 MONA implements an efficient decision procedure for the logic WS1S, and has already been applied in many non-trivial problems. Among these, we follow on from previous work done by Smith and Klarlund on the verification of a sliding-window protocol.
Howard Bowman +2 more
core
Data‐Driven Materials Science for Energy‐Sustainable Applications
Advanced Materials, EarlyView.Data‐driven approaches powered by artificial intelligence are transforming materials discovery for energy sustainability. This review examines how auto‐generated high‐quality materials databases and domain‐specific language models accelerate research in photovoltaics, thermoelectrics, batteries and magnetic materials. Applications involve extraction of
Jacqueline M. Cole
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
Scalable Task Planning via Large Language Models and Structured World Representations
Advanced Robotics Research, EarlyView.This work efficiently combines graph‐based world representations with the commonsense knowledge in Large Language Models to enhance planning techniques for the large‐scale environments that modern robots will need to face. Planning methods often struggle with computational intractability when solving task‐level problems in large‐scale environments ...
Rodrigo Pérez‐Dattari +4 more
wiley +1 more source