Results 81 to 90 of about 51,114 (288)
Formats of Winning Strategies for Six Types of Pushdown Games
, 2010 The solution of parity games over pushdown graphs (Walukiewicz '96) was the first step towards an effective theory of infinite-state games. It was shown that winning strategies for pushdown games can be implemented again as pushdown automata. We continue
Alexander Rabinovich +20 more
core +3 more sources
Robotic Materials With Bioinspired Microstructures for High Sensitivity and Fast Actuation
Advanced Science, EarlyView.In the review paper, design rationale and approaches for bioinspired sensors and actuators in robotics applications are presented. These bioinspired microstructure strategies implemented in both can improve the performance in several ways. Also, recent ideas and innovations that embed robotic materials with logic and computation with it are part of the
Sakshi Sakshi +4 more
wiley +1 more source
Finite Automata Implementations Considering CPU Cache
Acta Polytechnica, 2007 The finite automata are mathematical models for finite state systems. More general finite automaton is the nondeterministic finite automaton (NFA) that cannot be directly used.
J. Holub
doaj
Composing short 3-compressing words on a 2-letter alphabet [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A finite deterministic (semi)automaton A = (Q, Σ, δ) is k-compressible if there is some word w ∈ Σ + such that theimage of its state set Q under the natural action of w is reduced by at least k states.
Alessandra Cherubini +2 more
doaj +1 more source
One-Tape Turing Machine Variants and Language Recognition
, 2015 We present two restricted versions of one-tape Turing machines. Both characterize the class of context-free languages. In the first version, proposed by Hibbard in 1967 and called limited automata, each tape cell can be rewritten only in the first $d ...
Pighizzini, Giovanni
core +1 more source
Rotary Electromechanical System Integrating Non‐Reciprocal Memory and Combinational Logic
Advanced Science, EarlyView.Rotational bistability, interfaced through a conductive network with switchable contacts, unifies logic operations and mechanical memory within a rotary electromechanical system. The author demonstrates how serially coupled configurations of rotationally bistable modules enable reprogrammable sequential logic governed by mechanical state transition and
Shujia Chen, Don Straney, Damiano Pasini
wiley +1 more source
From LTL and Limit-Deterministic B\"uchi Automata to Deterministic Parity Automata
, 2017 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.
A Duret-Lutz +12 more
core +1 more source
Designing Memristive Materials for Artificial Dynamic Intelligence
Advanced Intelligent Discovery, EarlyView.Key characteristics required of memristors for realizing next‐generation computing, along with modeling approaches employed to analyze their underlying mechanisms. These modeling techniques span from the atomic scale to the array scale and cover temporal scales ranging from picoseconds to microseconds. Hardware architectures inspired by neural networks
Youngmin Kim, Ho Won Jang
wiley +1 more source
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications [PDF]
Logical Methods in Computer Science, 2011 We study the verification of a finite continuous-time Markov chain (CTMC) C against a linear real-time specification given as a deterministic timed automaton (DTA) A with finite or Muller acceptance conditions.
Taolue Chen +3 more
doaj +1 more source
Wadge Degrees of $\omega$-Languages of Petri Nets
, 2018 We prove that $\omega$-languages of (non-deterministic) Petri nets and $\omega$-languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of $\omega$-languages of (non ...
Finkel, Olivier
core +1 more source