Results 61 to 70 of about 283,589 (317)
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata
International Journal on Software Tools for Technology Transfer (STTT), 2022 Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction.
J. Esparza +3 more
semanticscholar +1 more source
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Previously, self-verifying symmetric difference automata were defined and a tight bound of 2^n-1-1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n at least 2, there is a regular language L_n
Laurette Marais, Lynette van Zijl
doaj +1 more source
History-deterministic Timed Automata [PDF]
Logical Methods in Computer ScienceWe explore the notion of history-determinism in the context of timed automata (TA) over infinite timed words. History-deterministic (HD) automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-
Sougata Bose +4 more
doaj +1 more source
MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Parametric timed automata extend timed automata (Alur and Dill, 1991) in that they allow the specification of parametric bounds on the clock values. Since their introduction in 1993 by Alur, Henzinger, and Vardi, it is known that the emptiness problem ...
Karin Quaas
doaj +1 more source
Exact solution of the Floquet-PXP cellular automaton. [PDF]
Physical Review E, 2020 We study the dynamics of a bulk deterministic Floquet model, the Rule 201 synchronous one-dimensional reversible cellular automaton (RCA201). The system corresponds to a deterministic, reversible, and discrete version of the PXP model, whereby a site ...
J. W. Wilkinson +3 more
semanticscholar +1 more source
Hyper-Minimization for Deterministic Weighted Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided.
Andreas Maletti, Daniel Quernheim
doaj +1 more source
Duality Between a Deterministic Cellular Automaton and a Bosonic Quantum Field Theory in 1+1 Dimensions [PDF]
, 2012 Methods developed in a previous paper are employed to define an exact correspondence between the states of a deterministic cellular automaton in 1+1 dimensions and those of a bosonic quantum field theory.
G. Hooft
semanticscholar +1 more source
Non-Deterministic Finite Cover Automata [PDF]
Scientific Annals of Computer Science, 2015 The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA ’98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages.
C. Câmpeanu
doaj +1 more source
Advanced Functional Materials, EarlyView.This study introduces a novel multi‐scale scaffold design using L‐fractals arranged in Archimedean tessellations for tissue regeneration. Despite similar porosity, tiles display vastly different tensile responses (1–100 MPa) and deformation modes. In vitro experiments with hMSCs show geometry‐dependent growth and activity. Over 55 000 tile combinations
Maria Kalogeropoulou +4 more
wiley +1 more source
The \v Cerný conjecture for aperiodic automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 A word w is called a synchronizing (recurrent, reset, directable) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some specific state; a DFA that has a synchronizing word is said to be synchronizable.
A. N. Trahtman
doaj +1 more source