Results 61 to 70 of about 51,114 (288)
Prikladnaya diskretnaya matematika, 2010 Summary: The article considers constructing minimal deterministic finite automaton recognizing a prefix-code of a given cardinality over the alphabet \(\{0,1\}\). The considered problem is proved to be equivalent to the problem of finding the shortest addition-chain ending with a given number.
Akishev, I. R., Dvorkin, M. È.
openaire +3 more sources
String-matching cannot be done by a two-head one-way deterministic finite automaton [PDF]
Information Processing Letters, 1986 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Ming, Yesha, Yaacov
openaire +2 more sources
Quantum finite multitape automata
, 1999 Quantum finite automata were introduced by C.Moore, J.P. Crutchfield, and by A.Kondacs and J.Watrous. This notion is not a generalization of the deterministic finite automata.
Ambainis, Andris +4 more
core +1 more source
Probabilistic Deterministic Finite Automata and Recurrent Networks, Revisited [PDF]
Entropy, 2019 Reservoir computers (RCs) and recurrent neural networks (RNNs) can mimic any finite-state automaton in theory, and some workers demonstrated that this can hold in practice.
Sarah E. Marzen, J. Crutchfield
semanticscholar +1 more source
Computing the Width of Non-deterministic Automata [PDF]
Logical Methods in Computer Science, 2019 We introduce a measure called width, quantifying the amount of nondeterminism in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of width 1, and where an accepting run can be built on-the-fly on any ...
Denis Kuperberg, Anirban Majumdar
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
Transductions Computed by One-Dimensional Cellular Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Cellular automata are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and to compute the ...
Martin Kutrib, Andreas Malcher
doaj +1 more source
Ice Lithography: Recent Progress Opens a New Frontier of Opportunities
Advanced Functional Materials, EarlyView.This review focuses on recent advancements in ice lithography, including breakthroughs in compatible precursors and substrates, processes and applications, hardware, and digital methods. Moreover, it offers a roadmap to uncover innovation opportunities for ice lithography in fields such as biological, nanoengineering and microsystems, biophysics and ...
Bingdong Chang +9 more
wiley +1 more source
Determinising Parity Automata [PDF]
, 2014 Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We prove that the
Schewe, Sven, Varghese, Thomas
core +1 more source
Emergent Motility of Self‐Organized Particle‐Giant Unilamellar Vesicle Assembly
Advanced Materials, EarlyView.Giant unilamellar vesicles (GUVs), when combined with silica particles under alternating electric fields, spontaneously self‐assemble into motile structures. Asymmetric particle decoration induces fluid flows that propel the assemblies, enabling persistent motion and reversible control.
Selcan Karaz +5 more
wiley +1 more source