Results 71 to 80 of about 2,538 (309)

Completeness Theorems for Kleene algebra with tests and top [PDF]

Logical Methods in Computer Science
We 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

A Lightweight Procedural Layer for Hybrid Experimental–Computational Workflows in Materials Science

Advanced Engineering Materials, EarlyView.
We unveil a prototype hybrid‐workflow framework that fuses automatedcomputation with hands‐on experiments. Built atop pyiron, a lightweight, parameterized layer translates procedure descriptions into executable manual steps, syncing instrument settings, human interventions, and data capture in real‐time today.
Steffen Brinckmann, Sarath Menon, Raphael Röske, Johannes Steinhülb, Michael Selzer, Jan Janssen, Tilmann Hickel, Ruth Schwaiger, Jörg Neugebauer   +8 more
wiley   +1 more source

Streamability of nested word transductions [PDF]

Logical Methods in Computer Science, 2019
We consider the problem of evaluating in streaming (i.e., in a single left-to-right pass) a nested word transduction with a limited amount of memory. A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that ...
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais   +3 more
doaj   +1 more source

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

Regular Separability of One Counter Automata [PDF]

Logical Methods in Computer Science, 2019
The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other.
Wojciech Czerwiński, Sławomir Lasota
doaj   +1 more source

Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages [PDF]

, 2008
The spider diagram logic forms a fragment of the constraint diagram logic and was designed to be primarily used as a diagrammatic software specification tool.
Simon Thompson, John Taylor, Taylor, John, Delaney, Aidan, Thompson, Simon, Aidan Delaney   +5 more
core   +1 more source

Toward Knowledge‐Based Workflows: A Semantic Approach to Atomistic Simulations for Mechanical and Thermodynamic Properties

Advanced Engineering Materials, EarlyView.
Knowledge‐based atomistic workflows are presented for mechanical and thermodynamic properties. By coupling modular simulations with ontology‐aligned metadata and provenance, Fe case studies on elastic behavior, defects, thermal properties, and Hall–Petch strengthening reveal how FAIR, queryable, and reusable simulation data can be generated. Mechanical
Abril Azócar Guzmán, Hoang‐Thien Luu, Sarath Menon, Tilmann Hickel, Nina Merkert, Stefan Sandfeld   +5 more
wiley   +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, Zhaoting Li, Robert Babuška, Jens Kober, Cosimo Della Santina   +4 more
wiley   +1 more source

Grounding Large Language Models for Robot Task Planning Using Closed‐Loop State Feedback

Advanced Robotics Research, EarlyView.
BrainBody‐Large Language Model (LLM) introduces a hierarchical, feedback‐driven planning framework where two LLMs coordinate high‐level reasoning and low‐level control for robotic tasks. By grounding decisions in real‐time state feedback, it reduces hallucinations and improves task reliability.
Vineet Bhat, Ali Umut Kaypak, Prashanth Krishnamurthy, Ramesh Karri, Farshad Khorrami   +4 more
wiley   +1 more source

Fresh-Register Automata

, 2011
What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store
Tzevelekos, N, Nikos Tzevelekos
core   +1 more source