Results 51 to 60 of about 1,576 (262)
Composed Bisimulation for Tree Automata [PDF]
International Journal of Foundations of Computer Science, 2008 We address the problem of reducing the size of (nondeterministic, bottom-up) tree automata (TA) using suitable, language-preserving equivalences on the states of the automata. In particular, we propose the so-called composed bisimulation equivalence as a new language preserving equivalence.
Parosh Aziz Abdulla +4 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.This article presents the NFDI‐MatWerk Ontology (MWO), a Basic Formal Ontology‐based framework for interoperable research data management in materials science and engineering (MSE). Covering consortium structures, research data management resources, services, and instruments, MWO enables semantic integration, Findable, Accessible, Interoperable, and ...
Hossein Beygi Nasrabadi +4 more
wiley +1 more source
Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue
Algorithms, 2016 We briefly report on the national workshops on Formal Languages and Automata Theory as well as on Algorithms and Complexity Theory held in early Autumn, 2015.
Henning Fernau
doaj +1 more source
Ultimate TreeAutomizer (CHC-COMP Tool Description) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We present Ultimate TreeAutomizer, a solver for satisfiability of sets of constrained Horn clauses. Constrained Horn clauses (CHC) are a fragment of first order logic with attractive properties in terms of expressiveness and accessibility to algorithmic ...
Daniel Dietsch +4 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.This article presents the design, modeling, and characterization of air‐pressure–actuated programmable vibroacoustic metamaterials (PVAMM). The study focuses on leveraging air pressure to dynamically tune resonance frequencies for effective noise attenuation.
William Kaal +2 more
wiley +1 more source
Test derivation based on tree FSMs and tree automata
Труды Института системного программирования РАН, 2018 In this paper, an approach for testing software implementations of telecommunication protocols based on tree finite state machines (FSM) is proposed. The first step is the extraction of the specification Extended FSM from an informal protocol description.
Maria Forostyanova
doaj +1 more source
Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective [PDF]
Logical Methods in Computer Science, 2017 Notions of simulation, among other uses, provide a computationally tractable and sound (but not necessarily complete) proof method for language inclusion.
Natsuki Urabe, Ichiro Hasuo
doaj +1 more source
Randomization in Automata on Infinite Trees [PDF]
ACM Transactions on Computational Logic, 2014 We study finite automata running over infinite binary trees. A run of such an automaton over an input tree is a tree labeled by control states of the automaton: the labeling is built in a top-down fashion and should be consistent with the transitions of the automaton.
Carayol, Arnaud +2 more
openaire +3 more sources
Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows
Advanced Engineering Materials, EarlyView.A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba +5 more
wiley +1 more source
Multimodal Data‐Driven Microstructure Characterization
Advanced Engineering Materials, EarlyView.A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang +4 more
wiley +1 more source