Results 71 to 80 of about 51,114 (288)

Efficient Implementation for Deterministic Finite Tree Automata Minimization

Journal of Computing and Information Technology, 2016
We address the problem of deterministic finite tree automata (DFTA) minimization. We describe a new alternative to implement both standard and incremental tree automata minimization using a well-defined graph representing the automaton to be minimized ...
Younes Guellouma, Hadda Cherroun
doaj   +1 more source

The Complexity of Codiagnosability for Discrete Event and Timed Systems [PDF]

, 2010
In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA).
D. Kozen, F. Cassez, F. Cassez, F. Cassez, G. Behrmann, G.J. Holzmann, L. Aceto, P. Bouyer, P. Bouyer, P. Ramadge, P. Ramadge, R. Alur, R. Debouk, S. Tripakis, T.S. Yoo, W. Qiu, Y. Wang   +16 more
core   +3 more sources

Recent Advances in Collective Behaviors of Micro/Nanomotor Swarms

Advanced Materials, EarlyView.
This review describes the driving forces behind collective motion, explores the self‐organization of micro/nano swarms across zero‐dimensional (0D), one‐dimensional (1D), two‐dimensional (2D), and three‐dimensional (3D) spaces, and highlights their potential in drug delivery, environmental monitoring, and smart devices.
Siwen Sun, Bingbing Sun, Alexander B. Cook, Tania Patiño Padial, Jan C. M. van Hest   +4 more
wiley   +1 more source

Subset Synchronization of Transitive Automata [PDF]

Electronic Proceedings in Theoretical Computer Science, 2014
We consider the following generalized notion of synchronization: A word is called a reset word of a subset of states of a deterministic finite automaton if it maps all states of the set to a unique state. It is known that the minimum length of such words
Vojtěch Vorel
doaj   +1 more source

Photonic Crystal Enhanced Microscopy on a 2D Photonic Crystal Surface

Advanced Materials Technologies, Volume 10, Issue 6, March 18, 2025.
This work demonstrates the design, fabrication, and the first‐time test of a 2D photonic crystal surface for photonic resonator absorption microscopy. The designed surface uniformly enhances electromagnetic near fields, achieving > 100% improved detecting uniformity for surface‐captured AuNPs from a blocking biosensor assay aimed for detecting SARS‐CoV‐
Weinan Liu, Siyan Li, Edmond Chow, Seemesh Bhaskar, Ying Fang, Brian T. Cunningham   +5 more
wiley   +1 more source

Quantitative Automata under Probabilistic Semantics

, 2019
Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions,
Chatterjee, Krishnendu, Henzinger, Thomas A., Otop, Jan   +2 more
core   +1 more source

Programmable Dimensional Lithography with Digital Micromirror Devices for Multifunctional Microarchitectures

Advanced Materials Technologies, EarlyView.
This review explores recent advances in digital micromirror device (DMD)‐based lithography, focusing on its programmable light modulation, multi‐material compatibility, and dimensional patterning strategies. It highlights innovations from optical system design to materials integration and multifunctional applications, positioning DMD lithography as a ...
Yubin Lee, Byungcheon Yoo, Chaeyeong Ryu, Jongwon Oh, Dahye Baek, Jiseok Lee   +5 more
wiley   +1 more source

Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game

Mathematics, 2018
The meticulous study of finite automata has produced many important and useful results. Automata are simple yet efficient finite state machines that can be utilized in a plethora of situations. It comes, therefore, as no surprise that they have been used
Theodore Andronikos, Alla Sirokofskich, Kalliopi Kastampolidou, Magdalini Varvouzou, Konstantinos Giannakis, Alexander Singh   +5 more
doaj   +1 more source

Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]

Logical Methods in Computer Science, 2007
String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure.
Joost Engelfriet, Hendrik Jan Hoogeboom
doaj   +1 more source

Hard‐Magnetic Soft Millirobots in Underactuated Systems

Advanced Robotics Research, EarlyView.
This review provides a comprehensive overview of hard‐magnetic soft millirobots in underactuated systems. It examines key advances in structural design, physics‐informed modeling, and control strategies, while highlighting the interplay among these domains.
Qiong Wang, Zixuan Zhang, Bingyan Li, Junkai Wang, Hongcheng Gu   +4 more
wiley   +1 more source